Geometric hitting set for segments of few orientations (Q1743112): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
aliases / en / 0aliases / en / 0
 
Geometric Hitting Set for Segments of Few Orientations
description / endescription / en
scientific article
scientific article; zbMATH DE number 6545973
Property / title
 
Geometric Hitting Set for Segments of Few Orientations (English)
Property / title: Geometric Hitting Set for Segments of Few Orientations (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1383.68092 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-28684-6_13 / rank
 
Normal rank
Property / published in
 
Property / published in: Approximation and Online Algorithms / rank
 
Normal rank
Property / publication date
 
26 February 2016
Timestamp+2016-02-26T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 26 February 2016 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6545973 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2950710020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2296662925 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1603.06077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3132896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-linear lower bound for planar epsilon-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability issues of guarding a set of segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding a set of line segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for a geometric set cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for geometric set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost optimal set covers in finite VC-dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for polytope covering and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical approach to parallel repetition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Stabbing Rectangles and Squares in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of covering points by lines and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting sets when the VC-dimension is small / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and lower bounds for stabbing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for hitting objects with straight lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for covering and packing problems in image processing and VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point Line Cover: The Easy Kernel is Essentially Tight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering things with things / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of locating linear facilities in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved results on geometric hitting set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for the size of epsilon-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945523 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:59, 15 July 2024

scientific article; zbMATH DE number 6545973
  • Geometric Hitting Set for Segments of Few Orientations
Language Label Description Also known as
English
Geometric hitting set for segments of few orientations
scientific article; zbMATH DE number 6545973
  • Geometric Hitting Set for Segments of Few Orientations

Statements

Geometric hitting set for segments of few orientations (English)
0 references
Geometric Hitting Set for Segments of Few Orientations (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
12 April 2018
0 references
26 February 2016
0 references
0 references
0 references
set cover
0 references
hitting set
0 references
approximation algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references