626 search results - page 23 / 126 » On Approximability of Minimum Bisection Problem |
109
click to vote
ISAAC
2005
Springer
15 years 4 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
FOCS
2003
IEEE
15 years 4 months ago
2003
IEEE
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...
IPL
2007
14 years 11 months ago
2007
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
DAM
2006
14 years 11 months ago
2006
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
124
click to vote
FAW
2010
Springer
14 years 11 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...