scientific article; zbMATH DE number 2081015

MaRDI QIDQ4474116zbMATH OpenFDO

Authors Sofia Kovaleva, Frits C. R. Spieksma

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2223/22230493.htm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Integer programming (90C10)

Recommendations

• Primal-dual approximation algorithms for a packing-covering pair of problems
• On combinatorial approximation of covering 0-1 integer programs and partial set cover
• Approximating the dense set-cover problem
• Approximation algorithms for covering/packing integer programs
• On the facial structure of the set covering polytope

Cited in

(13)

• Weighted geometric set cover with rectangles of bounded integer side lengths
• A 4.31-approximation for the geometric unique coverage problem on unit disks
• The parameterized complexity of stabbing rectangles
• Primal-dual approximation algorithms for a packing-covering pair of problems
• Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
• The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
• Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
• scientific article; zbMATH DE number 7376034 (Why is no real title available?)
• scientific article; zbMATH DE number 7378687 (Why is no real title available?)
• scientific article; zbMATH DE number 5019895 (Why is no real title available?)
• Improved approximation algorithms for geometric set cover
• Improved approximation algorithms for geometric set cover
• On the approximability of covering points by lines and related problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474116)