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

DOI10.1007/978-3-642-22300-6_18zbMATH Open1342.90090OpenAlexW2153007741MaRDI QIDQ5199243FDOQ5199243

Authors: Danny Z. Chen, Haitao Wang 

Publication date: 12 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22300-6_18

Recommendations

• New algorithms for facility location problems on the real line
• Improved algorithms for path partition and related problems
• scientific article; zbMATH DE number 2185624
• OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
• The \(k\)-centrum multi-facility location problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Discrete location and assignment (90B80)

Cited In (2)

• Improved algorithms for path partition and related problems
• New algorithms for facility location problems on the real line

This page was built for publication: New algorithms for 1-D facility location and path equipartition problems

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