Sciweavers

3875 search results - page 14 / 775
» Approximation Algorithms for the Max-coloring Problem
Sort
View
89
Voted
STOC
1991
ACM
95views Algorithms» more  STOC 1991»
15 years 6 months ago
Fast Approximation Algorithms for Multicommodity Flow Problems
Frank Thomson Leighton, Fillia Makedon, Serge A. P...
SODA
1998
ACM
89views Algorithms» more  SODA 1998»
15 years 3 months ago
Approximation Algorithms for Directed Steiner Problems
Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zu...
ATAL
2007
Springer
15 years 6 months ago
A swarm based approximated algorithm to the extended generalized assignment problem (E-GAP)
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
Paulo Roberto Ferreira Jr., Felipe S. Boffo, Ana L...
114
Voted
STOC
1994
ACM
97views Algorithms» more  STOC 1994»
15 years 6 months ago
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
Naveen Garg, Dorit S. Hochbaum
102
Voted
4OR
2008
56views more  4OR 2008»
15 years 2 months ago
Exact and approximate resolution of integral multiflow and multicut problems: algorithms and complexity
This is a summary of the author's PhD thesis supervised by Marie-Christine Costa and Fr
Cédric Bentz