Simple heuristics for unit disk graphs (Q4698229): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Madhav V. Marathe / rank
 
Normal rank
Property / author
 
Property / author: Harry B. III Hunt / rank
 
Normal rank
Property / author
 
Property / author: Daniel J. Rosenkrantz / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2139349113 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56019093 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/9409226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975168 / rank
 
Normal rank

Latest revision as of 13:26, 23 May 2024

scientific article; zbMATH DE number 755103
Language Label Description Also known as
English
Simple heuristics for unit disk graphs
scientific article; zbMATH DE number 755103

    Statements

    Simple heuristics for unit disk graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 June 1995
    0 references
    unit disk graphs
    0 references
    maximum independent set
    0 references
    minimum vertex cover
    0 references
    minimum coloring
    0 references
    minimum dominating set
    0 references
    on-line coloring heuristic
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers