Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking (Q1742371): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59528414, #quickstatements; #temporary_batch_1706897434465
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/s00453-017-0347-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2737247819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent set of intersection graphs of convex objects in 2D / rank
 
Normal rank
Property / cites work
 
Property / cites work: Label placement by maximum independent set in rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for maximum independent set of pseudo-disks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Approximation Schemes for Geometric Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal packing and covering in the plane are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Mining with optimized two-dimensional association rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons / 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: Q4250205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast stabbing of boxes in high dimensions / rank
 
Normal rank

Latest revision as of 11:39, 15 July 2024

scientific article
Language Label Description Also known as
English
Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking
scientific article

    Statements

    Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking (English)
    0 references
    0 references
    0 references
    11 April 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    independent set
    0 references
    geometric intersection graphs
    0 references
    PTAS
    0 references
    shrinking
    0 references
    resource augmentation
    0 references
    convex polygons
    0 references
    0 references
    0 references