Sciweavers

3875 search results - page 105 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
15 years 2 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
16 years 4 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
P2P
2009
IEEE
115views Communications» more  P2P 2009»
15 years 11 months ago
An Approximation Algorithm for Minimum-Delay Peer-to-Peer Streaming
Peer-to-peer (P2P) technology provides a scalable solution in multimedia streaming. Many streaming applications, such as IPTV and video conferencing, have rigorous constraints on ...
Fei Huang, Binoy Ravindran, Anil Vullikanti
JMLR
2012
13 years 6 months ago
On Bisubmodular Maximization
Bisubmodularity extends the concept of submodularity to set functions with two arguments. We show how bisubmodular maximization leads to richer value-of-information problems, usin...
Ajit Singh, Andrew Guillory, Jeff Bilmes
INFOCOM
2008
IEEE
15 years 11 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...