Pages that link to "Item:Q866970"
From MaRDI portal
The following pages link to Improved approximation algorithms for geometric set cover (Q866970):
Displaying 50 items.
- Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102) (← links)
- Small strong epsilon nets (Q396471) (← links)
- A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space (Q407569) (← links)
- The class cover problem with boxes (Q419500) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- 1.5D terrain guarding problem parameterized by guard range (Q501659) (← links)
- The number of holes in the union of translates of a convex set in three dimensions (Q512258) (← links)
- The within-strip discrete unit disk cover problem (Q528480) (← links)
- Improved results on geometric hitting set problems (Q603882) (← links)
- A non-linear lower bound for planar epsilon-nets (Q664354) (← links)
- An improved approximation algorithm for the most points covering problem (Q692901) (← links)
- Hitting sets online and unique-MAX coloring (Q741535) (← links)
- One-sided discrete terrain guarding and chordal graphs (Q831703) (← links)
- Approximately dominating representatives (Q870264) (← links)
- On the approximability of covering points by lines and related problems (Q904111) (← links)
- Approximation algorithms for art gallery problems in polygons (Q968202) (← links)
- On the union complexity of families of axis-parallel rectangles with a low packing number (Q1627208) (← links)
- Survey of quantitative methods in construction (Q1651605) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
- Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation (Q1755780) (← links)
- Small candidate set for translational pattern search (Q2088592) (← links)
- Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs (Q2098337) (← links)
- Parameter analysis for guarding terrains (Q2118384) (← links)
- Covering problem on fuzzy graphs and its application in disaster management system (Q2157042) (← links)
- Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
- On the geometric set multicover problem (Q2167317) (← links)
- The \(\varepsilon\)-\(t\)-net problem (Q2167320) (← links)
- Capacitated covering problems in geometric spaces (Q2189730) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- Altitude terrain guarding and guarding uni-monotone polygons (Q2331221) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- A fixed-parameter algorithm for guarding 1.5D terrains (Q2354771) (← links)
- A finite dominating set of cardinality \(O(k)\) and a witness set of cardinality \(O(n)\) for 1.5D terrain guarding problem (Q2400004) (← links)
- The parameterized complexity of stabbing rectangles (Q2428672) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
- A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- Constrained hitting set problem with intervals (Q2695330) (← links)
- AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS (Q2929639) (← links)
- On Guarding Orthogonal Polygons with Sliding Cameras (Q2980898) (← links)
- Covering Polygons with Rectangles (Q2988828) (← links)
- Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
- A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces (Q3451756) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q3452835) (← links)
- Stabbing Convex Polygons with a Segment or a Polygon (Q3541074) (← links)
- AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER (Q3560062) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
