The obnoxious center problem on weighted
✍
Blaž Zmazek; Janez Žerovnik
📂
Article
📅
2004
🏛
Elsevier Science
🌐
English
⚖ 264 KB
The obnoxious center problem in a graph G asks for a location on an edge of the graph such that the minimum weighted distance from this point to a vertex of the graph is as large as possible. An algorithm is given which ÿnds the obnoxious center on a weighted cactus graph in O(cn) time, where n is t