On locating a single path-like facility in a general graph

DOI10.1051/RO/1997310201071MaRDI QIDQ4342758zbMATH OpenOpenAlexFDO

Authors Abraham P. Punnen

Publication date 5 October 1997

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/105144

zbMATH Keywords

computational complexitylocation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Optimal location of a path or tree on a network with cycles
• Algorithms for central-median paths with bounded length on trees
• scientific article; zbMATH DE number 1453000
• Range minimization problems in path-facility location on trees

Cited in

(3)

• The location of median paths on grid graphs
• Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
• On fixed-parameter solvability of the minimax path location problem

This page was built for publication: On locating a single path-like facility in a general graph

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