791 search results - page 10 / 159 » Approximating the Maximum Sharing Problem |
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
WICON
2008
13 years 9 months ago
2008
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
JSAT
2006
13 years 7 months ago
2006
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
FCT
2005
Springer
14 years 1 months ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...