Approximation algorithms for hitting objects with straight lines
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- A Greedy Heuristic for the Set-Covering Problem
- A linear-time approximation algorithm for the weighted vertex cover problem
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Approximation algorithms for combinatorial problems
- Approximation schemes for covering and packing problems in image processing and VLSI
- On the complexity of locating linear facilities in the plane
- On the complexity of polyhedral separability
- On the ratio of optimal integral and fractional covers
Cited in
(26)- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
- Optimal Insertion of a Segment Highway in a City Metric
- On the approximability of orthogonal order preserving layout adjustment
- Partial multicovering and the d-consecutive ones property
- The parameterized complexity of stabbing rectangles
- A faster algorithm for finding minimum Tucker submatrices
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
- Latency Constrained Aggregation in Chain Networks Admits a PTAS
- APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES
- On the shortest separating cycle
- On a minimum linear classification problem
- Cutting polygons into small pieces with chords: Laser-based localization
- A polynomial-time algorithm for finding a minimal conflicting set containing a given row
- SEPARATING POINTS BY AXIS-PARALLEL LINES
- The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
- Guarding orthogonal art galleries with sliding cameras
- On the parameterized complexity of multiple-interval graph problems
- Hypergraph representation via axis-aligned point-subspace cover
- Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions
- Improved parameterized algorithms for minimum link-length rectilinear spanning path problem
- On Covering Points with Minimum Turns
- On fair covering and hitting problems
- Traversing a set of points with a minimum number of turns
- Fixed-parameter tractability and lower bounds for stabbing problems
- covering grid points in a convex polygon with straight lines∗
This page was built for publication: Approximation algorithms for hitting objects with straight lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1173978)
