Placing resources on a growing line

The k-Median Problem for Directed Trees

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science

A fully polynomial approximation algorithm for collaborative relaying in sensor networks under finite rate constraints

DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems

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

IEEE Transactions on Information Theory

New algorithms for 1-D facility location and path equipartition problems

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures