Sciweavers

3875 search results - page 36 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
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...
STOC
1994
ACM
97views Algorithms» more  STOC 1994»
15 years 1 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
4OR
2008
56views more  4OR 2008»
14 years 9 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
75
Voted
UAI
1994
14 years 11 months ago
Approximation Algorithms for the Loop Cutset Problem
We show how to nd a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the rst step in the method of conditioning for inference....
Ann Becker, Dan Geiger