Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity (Q2340410): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Jose A. Soto / rank
Normal rank
 
Property / author
 
Property / author: Jose A. Soto / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q65553896 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047993379 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1309.6659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering and coloring problems for relatives of intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Partial Order Dimension Problem / 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: Q4873786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching colored points with rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max point-tolerance graphs / 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: Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve / 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: Covering boxes by points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On point covers of parallel rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for finding a maximum weight 2-independent set on interval graphs / 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: The Problem of Compatible Representatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weighted min-max relation for intervals / 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: Jump Number of Two-Directional Orthogonal Ray Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine kombinatorisch-geometrische Frage von Hadwiger und Debrunner / rank
 
Normal rank

Latest revision as of 22:50, 9 July 2024

scientific article
Language Label Description Also known as
English
Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
scientific article

    Statements

    Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 April 2015
    0 references
    independent sets
    0 references
    rectangle selection
    0 references
    duality gap
    0 references

    Identifiers