Sciweavers

676 search results - page 56 / 136
» On Approximation Lower Bounds for TSP with Bounded Metrics
Sort
View
DC
2008
15 years 6 months ago
Solo-valency and the cost of coordination
This paper introduces solo-valency, a variation on the valency proof technique originated by Fischer, Lynch, and Paterson. The new technique focuses on critical events that influe...
Danny Hendler, Nir Shavit
AAIM
2006
Springer
110views Algorithms» more  AAIM 2006»
16 years 4 days ago
Non-metric Multicommodity and Multilevel Facility Location
Abstract. We give logarithmic approximation algorithms for the nonmetric uncapacitated multicommodity and multilevel facility location problems. The former algorithms are optimal u...
Rudolf Fleischer, Jian Li, Shijun Tian, Hong Zhu
GLOBECOM
2009
IEEE
16 years 27 days ago
How Bad is Single-Path Routing
—This paper investigates the network performance loss of using only single-path routing when multiple paths are available. The performance metric is the aggregate utility achieve...
Meng Wang, Chee Wei Tan, Ao Tang, Steven H. Low
DSN
2009
IEEE
16 years 27 days ago
MAP-AMVA: Approximate mean value analysis of bursty systems
MAP queueing networks are recently proposed models for performance assessment of enterprise systems, such as multi-tier applications, where workloads are significantly affected b...
Giuliano Casale, Evgenia Smirni
MFCS
2001
Springer
15 years 10 months ago
News from the Online Traveling Repairman
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
Sven Oliver Krumke, Willem de Paepe, Diana Poensge...