Sciweavers

1388 search results - page 71 / 278
» Approximability of Robust Network Design
Sort
View
FSTTCS
2009
Springer
14 years 4 months ago
Approximating Fault-Tolerant Group-Steiner Problems
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
LCTRTS
1999
Springer
14 years 1 months ago
A Software Synthesis Tool for Distributed Embedded System Design
We present a design tool for automated synthesis of embedded systems on distributed COTS-based platforms. Our synthesis tool consists of (1) a graphical user interface for input o...
Dong-In Kang, Richard Gerber, Leana Golubchik, Jef...
DSN
2011
IEEE
12 years 9 months ago
Resource and virtualization costs up in the cloud: Models and design choices
—Virtualization offers the potential for cost-effective service provisioning. For service providers who make significant investments in new virtualized data centers in support of...
Daniel Gmach, Jerry Rolia, Ludmila Cherkasova
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
14 years 10 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
ICAC
2006
IEEE
14 years 3 months ago
Hardness of Approximation and Greedy Algorithms for the Adaptation Problem in Virtual Environments
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
Ananth I. Sundararaj, Manan Sanghi, John R. Lange,...