Sciweavers

239 search results - page 2 / 48
» A Parallel Approximation Algorithm for the Weighted Maximum ...
Sort
View
PODC
2009
ACM
14 years 5 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
WEA
2007
Springer
108views Algorithms» more  WEA 2007»
13 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
PDCAT
2005
Springer
13 years 10 months ago
Approximating Spanning Trees with Inner Nodes Cost
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...
STACS
2010
Springer
13 years 2 months ago
Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model
ABSTRACT. We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. STACS '08, pages 6...
Leah Epstein, Asaf Levin, Julián Mestre, Da...
ICALP
2009
Springer
14 years 5 months ago
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
Elena Losievskaja, Geir Agnarsson, Magnús M...