Generalized class cover problem with axis-parallel strips

DOI10.1007/978-3-319-04657-0_4MaRDI QIDQ5746238zbMATH OpenOpenAlexFDO

Authors Apurva Mudgal, Supantha Pandit

Publication date 18 February 2014

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-04657-0_4

zbMATH Keywords

class cover problemapproximation algorithmsgeometric set coveraxis-parallel strips

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Approximation algorithms for the class cover problem
• The class cover problem with boxes
• Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions
• On a minimum linear classification problem
• On a minimum linear classification problem

Cited in

(4)

• Approximation algorithms for the class cover problem
• Orientational variable-length strip covering problem: a branch-and-price-based algorithm
• Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions
• Generalized class cover problem with axis-parallel strips

This page was built for publication: Generalized class cover problem with axis-parallel strips

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