Sciweavers

4266 search results - page 78 / 854
» The container loading problem
Sort
View
ICCCN
2008
IEEE
14 years 4 months ago
Localized Access Point Association in Wireless LANs with Bounded Approximation Ratio
— The current access point (AP) association schemes in wireless LANs, such as IEEE 802.11, cause an unbalanced load which reduces the performance of both the entire network and i...
Mingming Lu, Jie Wu
SOFSEM
2010
Springer
14 years 5 months ago
On a Labeled Vehicle Routing Problem
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
Hatem Chatti, Laurent Gourvès, Jér&o...
FCT
1999
Springer
14 years 2 months ago
Restrictive Acceptance Suffices for Equivalence Problems
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the promise class UP. We propose an analogous new method—weaker in strength of evidence ...
Bernd Borchert, Lane A. Hemaspaandra, Jörg Ro...
COCO
2004
Springer
133views Algorithms» more  COCO 2004»
14 years 3 months ago
Parameterized Complexity of Constraint Satisfaction Problems
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
Dániel Marx
COCOON
2006
Springer
14 years 2 months ago
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
Marc Benkert, Joachim Gudmundsson, Christian Knaue...