Pages that link to "Item:Q390102"

The following pages link to Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102):

Displaying 38 items.

• Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions (Q335346) (← links)
• Grid intersection graphs and order dimension (Q722596) (← links)
• On the approximability of covering points by lines and related problems (Q904111) (← links)
• \(\mathsf{NP}\)-hardness of geometric set cover and hitting set with rectangles containing a common point (Q1621499) (← links)
• Approximability and hardness of geometric hitting set with axis-parallel rectangles (Q1621500) (← links)
• Theoretical complexity of grid cover problems used in radar applications (Q1626552) (← links)
• An exact algorithm for a class of geometric set-cover problems (Q2030243) (← links)
• A tight analysis of geometric local search (Q2117344) (← links)
• Weighted geometric set cover with rectangles of bounded integer side lengths (Q2133398) (← links)
• A PTAS for the horizontal rectangle stabbing problem (Q2164717) (← links)
• Improved approximation bounds for the minimum constraint removal problem (Q2206735) (← links)
• Constructing planar support for non-piercing regions (Q2207613) (← links)
• On the geometric red-blue set cover problem (Q2232240) (← links)
• On interval and circular-arc covering problems (Q2327673) (← links)
• Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
• Computational complexity for the problem of optimal intersection of straight line segments by disks (Q2424188) (← links)
• New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs (Q2820855) (← 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)
• Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line (Q3467840) (← links)
• Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
• (Q5009492) (← links)
• On Geometric Set Cover for Orthants (Q5075763) (← links)
• (Q5091054) (← links)
• (Q5111691) (← links)
• (Q5115816) (← links)
• Algorithms for the line-constrained disk coverage and related problems (Q5896893) (← links)
• Recognition and drawing of stick graphs (Q5915944) (← links)
• Minimum membership covering and hitting (Q5918296) (← links)
• Algorithms for the line-constrained disk coverage and related problems (Q5918695) (← links)
• Maximum independent and disjoint coverage (Q5918798) (← links)
• Approximability of covering cells with line segments (Q5919568) (← links)
• On the geometric priority set cover problem (Q6103173) (← links)
• Geometric dominating-set and set-cover via local-search (Q6114477) (← links)
• Improved algorithms for minimum-membership geometric set cover (Q6547827) (← links)
• A PTAS for the horizontal rectangle stabbing problem (Q6589763) (← links)
• PTAS for minimum cost multicovering with disks (Q6593767) (← links)
• On the line-separable unit-disk coverage and related problems (Q6600812) (← links)