Sciweavers

3874 search results - page 24 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
ALGORITHMICA
2005
99views more  ALGORITHMICA 2005»
14 years 9 months ago
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
Marek Karpinski, Ion I. Mandoiu, Alexander Olshevs...
STOC
1991
ACM
95views Algorithms» more  STOC 1991»
15 years 1 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»
14 years 11 months ago
Approximation Algorithms for Directed Steiner Problems
Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zu...
ISAAC
2009
Springer
127views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
Laurent Bulteau, Guillaume Fertin, Irena Rusu
66
Voted
ATAL
2007
Springer
15 years 1 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...