Approximation Algorithms for Geometric Intersection Graphs (Q3508563): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Label placement by maximum independent set in rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs / 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: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Cut of a Planar Graph in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing graphs by disks and balls (a survey of recognition-complexity results) / rank
 
Normal rank
Property / cites work
 
Property / cites work: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5767542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple heuristics for unit disk graphs / rank
 
Normal rank

Latest revision as of 12:58, 28 June 2024

scientific article
Language Label Description Also known as
English
Approximation Algorithms for Geometric Intersection Graphs
scientific article

    Statements

    Approximation Algorithms for Geometric Intersection Graphs (English)
    0 references
    1 July 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references