Sciweavers

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

38

STACS
1999
Springer

favoriteEmaildiscussreport

87views Theoretical Computer Science» more STACS 1999»

Upper Bounds for Vertex Cover Further Improved

14 years 3 months ago

Upper Bounds for Vertex Cover Further Improved

Download theinf1.informatik.uni-jena.de

tended abstract of this work appears in the proceedings of the 16th Symposium on Theoretical Aspects of Computer Science (STACS’99), Springer, LNCS, held in Trier, Fed. Rep. of Germany, March 4–6, 1999. †Supported by a Feodor Lynen fellowship of the Alexander von Humboldt-Stiftung, Bonn, and the Center for Discrete Mathematics, Theoretical Computer Science and Applications (DIMATIA), Prague. 1

Rolf Niedermeier, Peter Rossmanith

Real-time Traffic

Computer Science | Feodor Lynen Fellowship | STACS 1999 | Theoretical Computer Science |

claim paper

Related Content

» Improved upper bounds for vertex cover

» Vertex Cover Further Observations and Further Improvements

» 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

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

» Frugality ratios and improved truthful mechanisms for vertex cover

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1999
Where	STACS
Authors	Rolf Niedermeier, Peter Rossmanith

Comments (0)