Sciweavers

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

4

NETWORKS
1998

favoriteEmaildiscussreport

62views Computer Networks» more NETWORKS 1998»

A polynomial algorithm for the p-centdian problem on a tree

13 years 4 months ago

A polynomial algorithm for the p-centdian problem on a tree

Download www.cs.ust.hk

Arie Tamir, Dionisio Pérez-Brito, Jos&eacut

Real-time Traffic

Computer Networks | NETWORKS 1998 |

claim paper

Related Content

» PolynomialTime Algorithms for the Ordered Maximum Agreement Subtree Problem

» Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables

» Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees

» Faster Steiner Tree Computation in PolynomialSpace

» Approximation Schemes for NodeWeighted Geometric Steiner Tree Problems

» A PolynomialTime Parsing Algorithm for TTMCTAG

» Treeedges deletion problems with bounded diameter obstruction sets

» Randomized Local Search Evolutionary Algorithms and the Minimum Spanning Tree Problem

» Lower bounds for the relative greedy algorithm for approximating Steiner trees

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1998
Where	NETWORKS
Authors	Arie Tamir, Dionisio Pérez-Brito, José A. Moreno-Pérez

Comments (0)