12519 search results - page 70 / 2504 » Approximation Problems Categories |
137
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
114
click to vote
ESA
2010
Springer
15 years 4 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...
125
click to vote
JCSS
2010
15 years 1 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 ...
CMA
2010
15 years 12 days ago
2010
In this paper, the homotopy analysis method (HAM) is applied to solve a parameterized sixth order boundary value problem which, for large parameter values, cannot be solved by oth...
123
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...