Yan Zhang

According to our database, Yan Zhang authored at least 7 papers between 2004 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2010

A dynamic programming approach to length-limited Huffman coding: space reduction with the Monge property.

Mordecai J. Golin, Yan Zhang

IEEE Trans. Inf. Theory, 2010

2008

A Dynamic Programming Approach To Length-Limited Huffman Coding

Mordecai J. Golin, Yan Zhang

CoRR, 2008

2007

The two-median problem on Manhattan meshes.

Mordecai J. Golin, Yan Zhang

Networks, 2007

A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs.

Khaled M. Elbassioni, René Sitters, Yan Zhang

Proceedings of the Algorithms, 2007

2006

Online Dynamic Programming Speedups.

Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang

Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity.

Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2004

Online Maintenance of k-Medians and k-Covers on a Line.

Rudolf Fleischer, Mordecai J. Golin, Yan Zhang

Proceedings of the Algorithm Theory, 2004