Sciweavers

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

143

Voted

EJC
2002

77views Information Technology» more EJC 2002»

Asymptotic Clique Covering Ratios of Distance Graphs

15 years 6 months ago

Asymptotic Clique Covering Ratios of Distance Graphs

Download www.calstatela.edu

Daphne Der-Fen Liu, Xuding Zhu

Real-time Traffic

EJC 2002 | Information Technology |

claim paper

Related Content

» An Algorithm to Discover the kClique Cover in Networks

» MinimumWeight Cycle Covers and Their Approximability

» Vertex Cover in Graphs with Locally Few Colors

» The minimum consistent subset cover problem and its applications in data mining

» A Tight Analysis of the Maximal Matching Heuristic

» Approximate Shortest Paths Guided by a Small Index

» Hardness results for approximating the bandwidth

» Approximations for minimum and minmax vehicle routing problems

» Symmetric range assignment with disjoint MST constraints

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	EJC
Authors	Daphne Der-Fen Liu, Xuding Zhu

Comments (0)