scientific article; zbMATH DE number 3888915

MaRDI QIDQ3221406zbMATH OpenFDO

Authors Dorit S. Hochbaum, Wolfgang Maass

Publication date 1984

zbMATH Keywords

computational geometrycoveringNP-completenesspackingpolynomial approximationquadratic algorithmshifting strategy

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Approximation schemes for covering and packing problems in image processing and VLSI
• Fast approximation algorithms for a nonconvex covering problem
• scientific article; zbMATH DE number 4215407
• Polynomial time approximation schemes for minimum disk cover problems
• Close approximations of minimum rectangular coverings

Cited in

(9)

• Approximation algorithms for pick-and-place robots
• Two for One: Tight Approximation of 2D Bin Packing
• scientific article; zbMATH DE number 4215407 (Why is no real title available?)
• Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
• A Robust PTAS for Machine Covering and Packing
• Approximation schemes for covering and packing problems in image processing and VLSI
• Fast approximation algorithms for a nonconvex covering problem
• Approximation algorithms for a geometric set cover problem
• Polynomial-time approximation schemes for packing and piercing fat objects

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 Q3221406)