626 search results - page 25 / 126 » On Approximability of Minimum Bisection Problem |
115
click to vote
IPL
1998
15 years 1 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
117
click to vote
JGAA
2000
15 years 1 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
ESA
2010
Springer
15 years 2 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
116
click to vote
JCSS
2010
14 years 11 months ago
2010
We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization ...
CCCG
2008
15 years 2 months ago
2008
We consider the problem of embroidering a design pattern, given by a graph G, using a single minimum length thread. We give an exact polynomial-time algorithm for the case that G ...