7006 search results - page 190 / 1402 » Approximation Algorithms |
124
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
139
click to vote
FOCS
2004
IEEE
15 years 6 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
153
click to vote
AAAI
2000
15 years 4 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
134
click to vote
ADHOCNOW
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
118
click to vote
JCT
2006
15 years 3 months ago
2006
We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications. The first is to graph "clique-wi...