Computing a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property

@article{Schieber1995ComputingAM,
  title={Computing a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property},
  author={Baruch Schieber},
  journal={J. Algorithms},
  year={1995},
  volume={29},
  pages={204-222}
}
LetGbe a weighted, complete, directed acyclic graph whose edge weights obey the concave Monge condition. We give an efficient algorithm for finding the minimum weightk-link path between a given pair of vertices for any givenk. The algorithm runs in time, fork=?(logn). Our algorithm can be applied to get efficient solutions for the following problems, improving on previous results: (1) computing length-limited Huffman codes, (2) computing optimal discrete quantization, (3) computing maximumk… CONTINUE READING

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 44 CITATIONS

Efficient list-approximation techniques for floorplan area minimization

  • ACM Trans. Design Autom. Electr. Syst.
  • 2001
VIEW 18 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

New Algorithms for Facility Location Problems on the Real Line

  • Algorithmica
  • 2012
VIEW 11 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Eecient Implementation of the Warm-up Algorithm for the Construction of Length-restricted Preex Codes

CodesRuy Luiz Milidi, Artur Alves Pessoa, Eduardo Sany LaberPontif
  • 1999
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Near-optimal depth-constrained codes

  • IEEE Transactions on Information Theory
  • 2004
VIEW 3 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

In-place length-restricted prefix coding

  • Proceedings. String Processing and Information Retrieval: A South American Symposium (Cat. No.98EX207)
  • 1998
VIEW 4 EXCERPTS
HIGHLY INFLUENCED

Perspectives of Monge Properties in Optimization

  • Discrete Applied Mathematics
  • 1996
VIEW 15 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED