Divide-and-conquer approximation algorithms via spreading metrics

Authors:
G. Even;J. Naor;S. Rao;B. Schieber
Affiliations:
-;-;-;-
Venue:
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Year:
1995

Citing 0
Cited 38

A network flow approach for hierarchical tree partitioning

DAC '97 Proceedings of the 34th annual Design Automation Conference
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Rounding algorithms for a geometric embedding of minimum multiway cut

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Scheduling to minimize average completion time: off-line and on-line algorithms

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Fast approximate graph partitioning algorithms

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
New approximation techniques for some ordering problems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

Journal of the ACM (JACM)
On local search and placement of meters in networks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Divide-and-conquer approximation algorithms via spreading metrics

Journal of the ACM (JACM)
Low Stretch Spanning Trees

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Circular Arrangements

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Flow Metrics

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Combinatorial algorithms for feedback problems in directed graphs

Information Processing Letters
A tight bound on approximating arbitrary metrics by tree metrics

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Breaking cycles for minimizing crossings

Journal of Experimental Algorithmics (JEA)
Approximating metrics by tree metrics

ACM SIGACT News
Experiments on the minimum linear arrangement problem

Journal of Experimental Algorithmics (JEA)
Circular arrangements and cyclic broadcast scheduling

Journal of Algorithms
Flow metrics

Theoretical Computer Science - Latin American theorotical informatics
Virtual coordinates for ad hoc and sensor networks

Proceedings of the 2004 joint workshop on Foundations of mobile computing
A tight bound on approximating arbitrary metrics by tree metrics

Journal of Computer and System Sciences - Special issue: STOC 2003
Cutwidth II: algorithms for partial w-trees of bounded degree

Journal of Algorithms
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Scalable performance-energy trade-off exploration of embedded real-time systems on multiprocessor platforms

Proceedings of the conference on Design, automation and test in Europe: Proceedings
snBench: programming and virtualization framework for distributed multitasking sensor networks

Proceedings of the 2nd international conference on Virtual execution environments
Designing PTASs for MIN-SUM scheduling problems

Discrete Applied Mathematics - Special issue: Efficient algorithms
On the interval completion of chordal graphs

Discrete Applied Mathematics
The approximability of non-Boolean satisfiability problems and restricted integer programming

Theoretical Computer Science
A Genetic Hillclimbing Algorithm for the Optimal Linear Arrangement Problem

Fundamenta Informaticae
How to rank with few errors

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Interval completion with few edges

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Learning to order things

Journal of Artificial Intelligence Research
On the interval completion of chordal graphs

Discrete Applied Mathematics
Designing PTASs for MIN-SUM scheduling problems

Discrete Applied Mathematics - Special issue: Efficient algorithms
Cutwidth II: Algorithms for partial w-trees of bounded degree

Journal of Algorithms
A Genetic Hillclimbing Algorithm for the Optimal Linear Arrangement Problem

Fundamenta Informaticae

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a novel divide-and-conquer paradigm for approximating NP-hard graph optimization problems. The paradigm models graph optimization problems that satisfy two properties: First, a divide-and-conquer approach is applicable. Second, a fractional spreading metric is computable in polynomial time. The spreading metric assigns fractional lengths to either edges or vertices of the input graph, such that all subgraphs on which the optimisation problem is non-trivial have large diameters. In addition, the spreading metric provides a lower bound, /spl tau/, on the cost of solving the optimization problem. We present a polynomial time approximation algorithm for problems modelled by our paradigm whose approximation factor is O (mi.