Obnoxious Centers in Graphs

DOI10.1137/09077638XMaRDI QIDQ3013158zbMATH OpenOpenAlexFDO

Authors S. Cabello, Günter Rote

Publication date 18 July 2011

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/09077638x

zbMATH Keywords

bounded treewidthfacility locationgraph algorithmsparametric searchplanar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Continuous location (90B85)

Recommendations

• Obnoxious centers in graphs
• scientific article; zbMATH DE number 1538875
• The obnoxious center problem on weighted cactus graphs.
• The obnoxious center problem on weighted cactus graphs (extended abstract)
• Obnoxious Facility Location on Graphs
• scientific article; zbMATH DE number 1161285
• Centers in path graphs
• Centers of triangulated graphs
• scientific article; zbMATH DE number 4114700
• Reverse selective obnoxious center location problems on tree graphs

Cited in

(7)

• The obnoxious center problem on weighted cactus graphs.
• The obnoxious center problem on a tree
• Obnoxious centers in graphs
• scientific article; zbMATH DE number 1538875 (Why is no real title available?)
• Dispersing Obnoxious Facilities on a Graph
• Geometric spanners of bounded tree-width
• Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study

This page was built for publication: Obnoxious Centers in Graphs

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