626 search results - page 75 / 126 » On Approximability of Minimum Bisection Problem |
148
click to vote
ALGORITHMICA
2004
15 years 5 months ago
2004
We investigate the diameter problem in the streaming and slidingwindow models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diamet...
162
click to vote
STACS
2009
Springer
16 years 9 days ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
170
click to vote
ESA
2007
Springer
15 years 11 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
135
click to vote
APPROX
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
113
click to vote
SOFSEM
2004
Springer
15 years 11 months ago
2004
Springer
We initiate a systematic study of the Row Deletion(B) problem on matrices: For a fixed “forbidden submatrix” B, the question is, given an input matrix A (both A and B have ent...