Obnoxious Centers in Graphs

DOI10.1137/09077638XzbMath1221.05073OpenAlexW2045123275MaRDI QIDQ3013158

Sergio 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

planar graphsfacility locationgraph algorithmsparametric searchbounded treewidth

Mathematics Subject Classification ID

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

Related Items (1)

Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study

This page was built for publication: Obnoxious Centers in Graphs