Sciweavers

5595 search results - page 134 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
WEA
2007
Springer
108views Algorithms» more  WEA 2007»
15 years 11 months ago
Engineering Algorithms for Approximate Weighted Matching
We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a rece...
Jens Maue, Peter Sanders
CIAC
2010
Springer
282views Algorithms» more  CIAC 2010»
15 years 8 months ago
Improved Approximations for TSP with Simple Precedence Constraints
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
Hans-Joachim Boeckenhauer, Ralf Klasing, Tobias Mo...
196
Voted
MOR
2007
149views more  MOR 2007»
15 years 4 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
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
GECCO
2009
Springer
254views Optimization» more  GECCO 2009»
15 years 11 months ago
Agglomerative genetic algorithm for clustering in social networks
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ...
Marek Lipczak, Evangelos E. Milios