Hu Zhang

Affiliations:
  • RBC Financial Group, Toronto, ON, Canada
  • McMaster University, Hamilton, ON, Canada (former)
  • University of Kiel, Institute of Computer Science and Applied Mathematics, Germany (PhD 2004)


According to our database1, Hu Zhang authored at least 13 papers between 2002 and 2008.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2008
Approximation algorithms for general packing problems and their application to the multicast congestion problem.
Math. Program., 2008

2007
Scheduling Malleable Tasks.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

2005
Packing Trees in Communication Networks.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

Implementation of Approximation Algorithms for the Multicast Congestion Problem.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Scheduling malleable tasks with precedence constraints.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

On Routing in VLSI Design and Communication Networks.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

An Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence Constraints.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Assign Ranges in General Ad-Hoc Networks.
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2004
Approximation algorithms for min-max resource sharing and malleable tasks scheduling.
PhD thesis, 2004

The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces.
Proceedings of the Structural Information and Communication Complexity, 2004

Solving Packing Problem with Weaker Block Solvers.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Packing: Scheduling, Embedding, and Approximating Metrics.
Proceedings of the Computational Science and Its Applications, 2004

2002
Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002


  Loading...