Sciweavers

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

88

Voted

TCS
2010

106views Theoretical Computer Science» more TCS 2010»

Improved upper bounds for vertex cover

15 years 1 months ago

Improved upper bounds for vertex cover

Download facweb.cs.depaul.edu

Jianer Chen, Iyad A. Kanj, Ge Xia

Real-time Traffic

TCS 2010 | Theoretical Computer Science |

claim paper

Related Content

» Upper Bounds for Vertex Cover Further Improved

» Vertex and Edge Covers with Clustering Properties Complexity and Algorithms

» Vertex Cover Kernelization Revisited Upper and Lower Bounds for a Refined Parameter

» Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies

» Vertex Cover in Graphs with Locally Few Colors

» Connected Vertex Covers in Dense Graphs

» Frugality ratios and improved truthful mechanisms for vertex cover

» Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

» Covering line graphs with equivalence relations

Post Info
More Details (n/a)

Added	31 Jan 2011
Updated	31 Jan 2011
Type	Journal
Year	2010
Where	TCS
Authors	Jianer Chen, Iyad A. Kanj, Ge Xia

Comments (0)