EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING (Q4682165): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static and Dynamic Algorithms for k-Point Clustering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated nearest neighbors and finding minimal polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Problem of Compatible Representatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time solution for labeling a rectilinear map / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate map labeling is in \(\Omega (n\log n)\) / rank
 
Normal rank

Latest revision as of 11:17, 10 June 2024

scientific article; zbMATH DE number 2174816
Language Label Description Also known as
English
EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING
scientific article; zbMATH DE number 2174816

    Statements

    EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING (English)
    0 references
    0 references
    0 references
    10 June 2005
    0 references
    Approximation algorithms
    0 references
    map labeling
    0 references
    NP-hardness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references