Pages that link to "Item:Q4808318"
From MaRDI portal
The following pages link to Polynomial-time approximation schemes for packing and piercing fat objects (Q4808318):
Displaying 50 items.
- Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve (Q364848) (← links)
- Closest pair and the post office problem for stochastic points (Q390124) (← links)
- A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space (Q407569) (← links)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- Approximation algorithms for maximum independent set of a unit disk graph (Q483059) (← links)
- Matching colored points with rectangles (Q511687) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Piercing translates and homothets of a convex body (Q634671) (← links)
- The reach of axis-aligned squares in the plane (Q783038) (← links)
- Generalized disk graphs (Q832849) (← links)
- A randomized algorithm for online unit clustering (Q839627) (← links)
- Geometric representation of graphs in low dimension using axis parallel boxes (Q848956) (← links)
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854) (← links)
- Computationally-feasible truthful auctions for convex bundles (Q932809) (← links)
- On covering problems of Rado (Q970613) (← links)
- Approximating minimum independent dominating sets in wireless networks (Q975555) (← links)
- A note on maximum independent sets in rectangle intersection graphs (Q1029038) (← links)
- An improved approximation algorithm for the discrete Fréchet distance (Q1653046) (← links)
- Anchored rectangle and square packings (Q1751252) (← links)
- Packing and covering with non-piercing regions (Q1991095) (← links)
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks (Q2046270) (← links)
- Piercing all translates of a set of axis-parallel rectangles (Q2115866) (← links)
- Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
- Consistent dynamic map labeling with fairness and importance (Q2197926) (← links)
- Range assignment of base-stations maximizing coverage area without interference (Q2283033) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- Geometric red-blue set cover for unit squares and related problems (Q2341691) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
- Polynomial-time approximation schemes for piercing and covering with applications in wireless networks (Q2477196) (← links)
- Independent set of intersection graphs of convex objects in 2D (Q2489017) (← links)
- Approximation algorithms on consistent dynamic map labeling (Q2629235) (← links)
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs (Q2700783) (← links)
- Improved Algorithm for Maximum Independent Set on Unit Disk Graph (Q2795948) (← links)
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
- Coloring and Maximum Independent Set of Rectangles (Q3088088) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q3452835) (← links)
- PACKING A TRUCK — NOW WITH A TWIST! (Q3503017) (← links)
- On Covering Problems of Rado (Q3512467) (← links)
- MAXIMUM AREA INDEPENDENT SETS IN DISK INTERSECTION GRAPHS (Q3562849) (← links)
- ON PARAMETERIZED COMPLEXITY OF HITTING SET PROBLEM FOR AXIS–PARALLEL SQUARES INSTERSECTING A STRAIGHT LINE (Q4581438) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
- Geometric Packing under Nonuniform Constraints (Q4593249) (← links)
- Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking (Q5111257) (← links)
- (Q5111691) (← links)
- (Q5115779) (← links)
- On Partial Covering For Geometric Set Systems (Q5115815) (← links)
- Domination in Geometric Intersection Graphs (Q5458576) (← links)
