scientific article; zbMATH DE number 2079337

MaRDI QIDQ4471292zbMATH OpenFDO

Authors Mikkel Thorup

Publication date 28 July 2004

zbMATH Keywords

shortest paths

Mathematics Subject Classification ID

Approximation algorithms (68W25) Discrete location and assignment (90B80)

Recommendations

• Automata, Languages and Programming
• Quick k-Median, k-Center, and Facility Location for Sparse Graphs
• scientific article; zbMATH DE number 1754597
• Approximation Algorithms for Metric Facility Location Problems
• Facility location with dynamic distance functions

Cited in

(5)

• Fast bounding procedures for large instances of the simple plant location problem
• A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties
• Quick k-Median, k-Center, and Facility Location for Sparse Graphs
• Automata, Languages and Programming
• Approximation algorithms for hierarchical location problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471292)