Search CORE

8 research outputs found

Lagrangian Relaxation and Partial Cover

Author: Mestre Julián
Publication venue
Publication date: 23/12/2007
Field of study

Lagrangian relaxation has been used extensively in the design of approximation algorithms. This paper studies its strengths and limitations when applied to Partial Cover.Comment: 20 pages, extended abstract appeared in STACS 200

arXiv.org e-Print Archive

CiteSeerX

MPG.PuRe

Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing

Author: A. Brandstädt
A. Brandstädt
A. Brandstädt
A. Frank
B.A. Reed
F.K.H.A. Dehne
F.V. Fomin
G. Xu
J. Chen
J. Flum
K. Wagner
L. Lovász
M. Chudnovsky
M. Dom
M. Dom
M. Grötschel
M.C. Golumbic
N. Mahadev
P. Erdős
P. Erdős
P. Erdős
P.C. Fishburn
R. Hassin
R. Niedermeier
R.D. Downey
S. Kovaleva
T.I.D.R. Gaur
W. Jia
Publication venue: 'Springer Science and Business Media LLC'
Publication date: 01/01/2010
Field of study

Crossref

Approximation Algorithms for Capacitated Rectangle Stabbing

Author: D.R. Gaur
J. Bar-Ilan
L.A. Wolsey
M.C. Golumbic
R. Gandhi
R. Hassin
S. Guha
Publication venue: 'Springer Science and Business Media LLC'
Publication date: 01/01/2006
Field of study

Crossref

Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem

Author: D. M. Nicol
D. M. Nicol
D. S. Hochbaum
D. S. Johnson
G. Fox
M. Grigni
M. J. Berger
R. Hassin
S. H. Bokhari
S. Khanna
V. Chvátal
Publication venue: 'Springer Science and Business Media LLC'
Publication date
Field of study

Crossref