Sciweavers

725 search results - page 68 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
SIGMETRICS
2004
ACM
115views Hardware» more  SIGMETRICS 2004»
15 years 3 months ago
Emulating low-priority transport at the application layer: a background transfer service
Low priority data transfer across the wide area is useful in several contexts, for example for the dissemination of large files such as OS updates, content distribution or prefet...
Peter B. Key, Laurent Massoulié, Bing Wang
ICMCS
2007
IEEE
137views Multimedia» more  ICMCS 2007»
15 years 4 months ago
Wireless Video Streaming with Collaborative Admission Control for Home Networks
Limited bandwidth and high packet loss pose a serious challenge for video streaming over wireless networks. Even when packet loss in the medium is not present, the fluctuating ava...
Monchai Lertsutthiwong, Thinh Nguyen, Alan Fern
ANOR
2007
80views more  ANOR 2007»
14 years 10 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...
FOCS
2009
IEEE
15 years 4 months ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák
FOCS
2007
IEEE
15 years 4 months ago
Towards Sharp Inapproximability For Any 2-CSP
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
Per Austrin