A new approximation algorithm for labeling points with circle pairs (Q845698): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: A simple factor-3 approximation for labeling points with circles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the multiple label placement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound for map labeling with uniform circle pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING / rank
 
Normal rank
Property / cites work
 
Property / cites work: EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING / rank
 
Normal rank

Revision as of 09:53, 2 July 2024

scientific article
Language Label Description Also known as
English
A new approximation algorithm for labeling points with circle pairs
scientific article

    Statements

    Identifiers