Pages that link to "Item:Q1173978"

The following pages link to Approximation algorithms for hitting objects with straight lines (Q1173978):

Displaying 27 items.

• Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions (Q335346) (← links)
• Fixed-parameter tractability and lower bounds for stabbing problems (Q359746) (← links)
• Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
• Partial multicovering and the \(d\)-consecutive ones property (Q408373) (← links)
• Improved parameterized algorithms for minimum link-length rectilinear spanning path problem (Q477189) (← links)
• A faster algorithm for finding minimum Tucker submatrices (Q693064) (← links)
• Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
• On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
• Geometric hitting set for segments of few orientations (Q1743112) (← links)
• Hypergraph representation via axis-aligned point-subspace cover (Q2154113) (← links)
• On the shortest separating cycle (Q2306364) (← links)
• Guarding orthogonal art galleries with sliding cameras (Q2401332) (← links)
• The parameterized complexity of stabbing rectangles (Q2428672) (← links)
• On fair covering and hitting problems (Q2672421) (← links)
• A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (Q3007640) (← links)
• SEPARATING POINTS BY AXIS-PARALLEL LINES (Q3373055) (← links)
• APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES (Q3397507) (← links)
• On the Approximability of Orthogonal Order Preserving Layout Adjustment (Q3449805) (← links)
• The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants (Q3507345) (← links)
• Optimal Insertion of a Segment Highway in a City Metric (Q3511373) (← links)
• Parameterized Complexity of Stabbing Rectangles and Squares in the Plane (Q3605506) (← links)
• Latency Constrained Aggregation in Chain Networks Admits a PTAS (Q3638456) (← links)
• covering grid points in a convex polygon with straight lines^∗ (Q3989786) (← links)
• Cutting polygons into small pieces with chords: Laser-based localization (Q5874470) (← links)
• On Covering Points with Minimum Turns (Q5892218) (← links)
• Traversing a set of points with a minimum number of turns (Q5901749) (← links)
• On a minimum linear classification problem (Q5920647) (← links)