Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Finding small simple cycle separators for 2-connected planar graphs
Journal of Computer and System Sciences
Improved complexity bounds for center location problems on networks by using dynamic data structures
SIAM Journal on Discrete Mathematics
Obnoxious facility location on graphs
SIAM Journal on Discrete Mathematics
Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Faster shortest-path algorithms for planar graphs
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Shortest paths in digraphs of small treewidth. Part II: optimal parallel algorithms
ESA '95 Selected papers from the third European symposium on Algorithms
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
SIAM Journal on Computing
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
The Obnoxious Center Problem on a Tree
SIAM Journal on Discrete Mathematics
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Placing an abnoxious facility in geometric networks
Nordic Journal of Computing
The obnoxious center problem on weighted cactus graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Multiple-source shortest paths in planar graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Planar graphs, negative weight edges, shortest paths, and near linear time
Journal of Computer and System Sciences - Special issue on FOCS 2001
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for the weighted 2-center problem in a cactus graph
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Locating two obnoxious facilities using the weighted maximin criterion
Operations Research Letters
Structured recursive separator decompositions for planar graphs in linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with $n$ vertices and $m$ edges, we give a randomized algorithm with $O(n\log^{2}n+m\log n)$ expected time. For planar graphs, we give algorithms with $O(n\log n)$ expected time and $O(n\log^{3}n)$ worst-case time. For graphs with bounded treewidth, we give an algorithm taking $O(n\log n)$ worst-case time. The algorithms make use of parametric search and several results for computing distances on graphs of bounded treewidth and planar graphs.