scientific article; zbMATH DE number 1786156

MaRDI QIDQ4547480zbMATH OpenFDO

Authors Blaž Zmazek, Janez Žerovnik

Publication date 21 August 2002

zbMATH Keywords

absolute center problemlinear-time algorithmlocation problems

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• The obnoxious center problem on weighted cactus graphs.
• scientific article; zbMATH DE number 1538875
• Algorithms and Computation
• scientific article; zbMATH DE number 4066949
• Efficient algorithms for center problems in cactus networks

Cited in

(14)

• Locating an absolute center on graphs that are almost trees
• The obnoxious center problem on weighted cactus graphs.
• A linear-time algorithm for solving the center problem on weighted cactus graphs
• An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs
• Efficient algorithms for center problems in cactus networks
• On the g-centroidal problem in special classes of perfect graphs
• scientific article; zbMATH DE number 4173027 (Why is no real title available?)
• scientific article; zbMATH DE number 4066949 (Why is no real title available?)
• Biobjective center – balance graph location model^*
• scientific article; zbMATH DE number 1538875 (Why is no real title available?)
• scientific article; zbMATH DE number 2166874 (Why is no real title available?)
• Algorithms and Computation
• A linear-time algorithm for the center problem in weighted cycle graphs
• A note on locating a central vertex of a 3-cactus graph

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 Q4547480)