2137 search results - page 52 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
CORR
2011
Springer
13 years 13 days ago
2011
Springer
: The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
EOR
2006
13 years 8 months ago
2006
We introduce the two-stage stochastic maximum-weight matching problem and demonstrate that this problem is NP-complete. We give a factor 1 2 approximation algorithm and prove its ...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
We consider the problem of aligned coloring of interval and chordal graphs. These problems have substantial applications to register allocation in compilers and have recently been ...
WINE
2005
Springer
14 years 2 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
WG
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...