Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem (Q5452162): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Andrzej Lingas / rank
Normal rank
 
Property / author
 
Property / author: Andrzej Lingas / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-77891-2_15 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1849516636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonally convex covering of orthogonal polygons without holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Polygons Is Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: On covering orthogonal polygons with star-shaped polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a Polygon into Simpler Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5292090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on covering monotone orthogonal polygons with star-shaped polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Graphs and Orthogonally Convex Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering orthogonal polygons with star polygons: The perfect graph approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-hard polygon decomposition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM / rank
 
Normal rank

Latest revision as of 18:57, 27 June 2024

scientific article; zbMATH DE number 5252760
Language Label Description Also known as
English
Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem
scientific article; zbMATH DE number 5252760

    Statements

    Identifiers