Sciweavers

83 search results - page 16 / 17
» Approximation algorithms for homogeneous polynomial optimiza...
Sort
View
TAMC
2009
Springer
13 years 9 months ago
On the Complexity of the Multiple Stack TSP, kSTSP
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
Sophie Toulouse, Roberto Wolfler Calvo
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
13 years 9 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 5 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
IROS
2009
IEEE
185views Robotics» more  IROS 2009»
13 years 12 months ago
Scalable and convergent multi-robot passive and active sensing
— A major barrier preventing the wide employment of mobile networks of robots in tasks such as exploration, mapping, surveillance, and environmental monitoring is the lack of ef...
Elias B. Kosmatopoulos, Lefteris Doitsidis, Konsta...
INFOCOM
2012
IEEE
11 years 7 months ago
DEAR: Delay-bounded Energy-constrained Adaptive Routing in wireless sensor networks
— Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with...
Shi Bai, Weiyi Zhang, Guoliang Xue, Jian Tang, Cho...