642 search results - page 45 / 129 » Approximation Algorithms for Minimum K-Cut |
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
114
click to vote
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
TALG
2010
14 years 10 months ago
2010
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
113
click to vote
ALGORITHMICA
2006
14 years 12 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—IEEE 802.11 WiFi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using h...