572 search results - page 3 / 115 » Exponential-Time Approximation of Hard Problems |
TAMC
2009
Springer
14 years 3 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 ...
FOCS
2004
IEEE
14 years 7 days 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 ...
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
d Abstract] Mikhail Alekhnovich ∗ Subhash A. Khot † Guy Kindler ‡ Nisheeth K. Vishnoi § We show that, unless NP⊆DTIME(2poly log(n) ), the closest vector problem with pre-...
CSR
2007
Springer
14 years 2 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...