Sciweavers

128 search results - page 23 / 26
» On Approximating Multi-Criteria TSP
Sort
View
FOCS
2007
IEEE
14 years 5 months ago
On the Optimality of Planar and Geometric Approximation Schemes
We show for several planar and geometric problems that the best known approximation schemes are essentially optimal with respect to the dependence on ǫ. For example, we show that...
Dániel Marx
TSP
2008
132views more  TSP 2008»
13 years 10 months ago
Differential Modulations for Multinode Cooperative Communications
Abstract--This paper proposes and analyzes differential modulation schemes for two cooperation protocols in multinode cooperative wireless networks; namely, multinode differential ...
Thanongsak Himsoon, W. Pam Siriwongpairat, Weifeng...
CORR
2007
Springer
167views Education» more  CORR 2007»
13 years 10 months ago
Approximation Algorithms for Orienteering with Time Windows
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
Chandra Chekuri, Nitish Korula
SASO
2007
IEEE
14 years 5 months ago
On Scaling Multi-Agent Task Reallocation Using Market-Based Approach
Multi-agent systems (MAS) provide a promising technology for addressing problems such as search and rescue missions, mine sweeping, and surveillance. These problems are a form of ...
Rajesh K. Karmani, Timo Latvala, Gul Agha
APSCC
2007
IEEE
13 years 11 months ago
Joint Sink Mobility and Data Diffusion for Lifetime Optimization in Wireless Sensor Networks
Abstract— In this paper, we address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularl...
Yu Gu, Hengchang Liu, Fei Song, Baohua Zhao