Sciweavers

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

98

Voted

WG
1999
Springer

61views Theoretical Computer Science» more WG 1999»

Vertex Cover: Further Observations and Further Improvements

15 years 7 months ago

Vertex Cover: Further Observations and Further Improvements

Download anyserver.cityu.edu.hk

Jianer Chen, Iyad A. Kanj, Weijia Jia

Real-time Traffic

Theoretical Computer Science | WG 1999 |

claim paper

Related Content

» Upper Bounds for Vertex Cover Further Improved

» A Better Approximation Ratio for the Vertex Cover Problem

» Solving minones2sat as Fast as vertex cover

» On Conditional Covering Problem

» 20 Years of Negamis Planar Cover Conjecture

» Improved Approximation Algorithms for Maximum Graph Partitioning Problems

» Analysis of Approximation Algorithms for kSet Cover Using FactorRevealing Linear Programs

» Encoding Quadrilateral Meshes

» Towards Automatic Retrieval of Album Covers

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1999
Where	WG
Authors	Jianer Chen, Iyad A. Kanj, Weijia Jia

Comments (0)