Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

25

COCOON
2001
Springer

favoriteEmaildiscussreport

106views Combinatorics» more COCOON 2001»

Polynomial Time Algorithms for Three-Label Point Labeling

14 years 3 months ago

Polynomial Time Algorithms for Three-Label Point Labeling

Download www.iis.sinica.edu.tw

Rob Duncan, Jianbo Qian, Binhai Zhu

Real-time Traffic

COCOON 2001 | Combinatorics |

claim paper

Related Content

» FixedPoint Definability and Polynomial Time on Graphs with Excluded Minors

» A Simple Factor23 Approximation Algorithm for TwoCircle Point Labeling

» A new bound for map labeling with uniform circle pairs

» AlmostUniform Sampling of Points on HighDimensional Algebraic Varieties

» An Optimal Probabilistic Graphical Model for Point Set Matching

» Optimal point removal in closed2PM labeling

» Tabu Search Heuristic for PointFeature Cartographic Label Placement

» PolynomialTime Algorithms for the Ordered Maximum Agreement Subtree Problem

» A new approximation algorithm for labeling points with circle pairs

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	COCOON
Authors	Rob Duncan, Jianbo Qian, Binhai Zhu

Comments (0)