A new approximation algorithm for labeling points with circle pairs
From MaRDI portal
Publication:845698
DOI10.1016/J.IPL.2006.04.006zbMATH Open1185.68781OpenAlexW2051593289MaRDI QIDQ845698FDOQ845698
Authors: Minghui Jiang 
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.04.006
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Iterated nearest neighbors and finding minimal polytopes
- Algorithms and Computation
- Static and Dynamic Algorithms for k-Point Clustering Problems
- A simple factor-3 approximation for labeling points with circles
- A new bound for map labeling with uniform circle pairs
- Algorithms for the multiple label placement problem
- Title not available (Why is that?)
- EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING
- A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING
Cited In (11)
- Title not available (Why is that?)
- LABELING POINTS WITH CIRCLES
- A simple factor-3 approximation for labeling points with circles
- Title not available (Why is that?)
- A new bound for map labeling with uniform circle pairs
- Approximation algorithms for the metric labeling problem via a new linear programming formulation
- Algorithms and Computation
- Title not available (Why is that?)
- Trimming of graphs, with application to point labeling
- Rotating Multiple Sets of Labeled Points to Bring Them Into Close Coincidence: A Generalized Wahba Problem
- A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING
This page was built for publication: A new approximation algorithm for labeling points with circle pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845698)
