2137 search results - page 40 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
121
click to vote
ICALP
2001
Springer
15 years 6 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
113
Voted
IPCO
1993
15 years 3 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
118
click to vote
CCCG
2006
15 years 3 months ago
2006
We study the graph partitioning problem on ddimensional ball graphs in a geometric way. Let B be a set of balls in d-dimensional Euclidean space with radius ratio and -precision....
133
click to vote
ESA
2005
Springer
15 years 7 months ago
2005
Springer
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...