1332 search results - page 3 / 267 » Combinatorial Algorithms |
ALGORITHMICA
2006
13 years 5 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, an...
WFLP
2009
Springer
13 years 12 months ago
2009
Springer
DAM
2006
13 years 5 months ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
ISVC
2007
Springer
13 years 11 months ago
2007
Springer
We formulate decomposition of two-dimensional shapes as a combinatorial optimization problem and present a dynamic programming algorithm that solves it.