Sciweavers

Share
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
9 years 9 months ago
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
APPROX
2005
Springer
88views Algorithms» more  APPROX 2005»
9 years 9 months ago
Approximating the Best-Fit Tree Under Lp Norms
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
Boulos Harb, Sampath Kannan, Andrew McGregor
ATAL
2007
Springer
9 years 10 months ago
Implementing the maximum of monotone algorithms
Running several sub-optimal algorithms and choosing the optimal one is a common procedure in computer science, most notably in the design of approximation algorithms. This paper d...
Liad Blumrosen
ICNP
2007
IEEE
9 years 10 months ago
Slotted Scheduled Tag Access in Multi-Reader RFID Systems
Abstract—Radio frequency identification (RFID) is a technology where a reader device can “sense” the presence of a closeby object by reading a tag device attached to the obj...
Zongheng Zhou, Himanshu Gupta, Samir R. Das, Xianj...
FOCS
2007
IEEE
9 years 10 months ago
Buy-at-Bulk Network Design with Protection
We consider approximation algorithms for buy-at-bulk network design, with the additional constraint that demand pairs be protected against edge or node failures in the network. In...
Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce...
INFOCOM
2008
IEEE
9 years 10 months ago
Proportional Fairness in Multi-Rate Wireless LANs
—In multi-rate wireless LANs, throughput-based fair bandwidth allocation can lead to drastically reduced aggregate throughput. To balance aggregate throughput while serving users...
Erran L. Li, Martin Pal, Yang Richard Yang
COMPGEOM
2009
ACM
9 years 10 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir
FSTTCS
2009
Springer
9 years 10 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
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
9 years 10 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
INFOCOM
2009
IEEE
9 years 10 months ago
Hardness and Approximation of the Survivable Multi-Level Fat Tree Problem
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
Hung Q. Ngo, Thanh-Nhan Nguyen, Dahai Xu
books