2752 search results - page 4 / 551 » Rounding to an Integral Program |
LATIN
2010
Springer
13 years 7 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
JAMDS
2002
13 years 8 months ago
2002
This paper draws attention to the risk of rounding error in the numerical evaluation of steady-state probabilities for the M/M family of queues. A method for avoiding the risk is p...
ICALP
2000
Springer
14 years 6 days ago
2000
Springer
d Abstract) Christian Cachin1 , Jan Camenisch1 , Joe Kilian2 , and Joy M
MOR
2000
13 years 8 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
MP
1998
13 years 8 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...