1332 search results - page 17 / 267 » Combinatorial Algorithms |
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
ASIAN
1995
Springer
13 years 11 months ago
1995
Springer
IPCO
2001
13 years 9 months ago
2001
This paper presents the first combinatorial polynomial algorithm for minimizing bisubmodular functions, extending the scaling algorithm for submodular function minimization due to ...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
JDA
2008
13 years 7 months ago
2008
The best approximation algorithm for Max Cut in graphs of maximum degree 3 uses semidefinite programming, has approximation ratio 0.9326, and its running time is (n3.5 log n) ; bu...