562 search results - page 1 / 113 » Approximation algorithms and hardness of the k-route cut pro... |
92
Voted
SODA
2012
ACM
13 years 3 months ago
2012
ACM
114
Voted
TAMC
2009
Springer
15 years 7 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
94
Voted
COCO
2005
Springer
15 years 6 months ago
2005
Springer
We show that the Multicut, Sparsest-Cut, and Min-2CNF≡ Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [S...
119
Voted
CORR
2008
Springer
15 years 1 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...
158
Voted
CORR
2007
Springer
15 years 26 days ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...