Sciweavers

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

8

COCOON
2010
Springer

favoriteEmaildiscussreport

179views Combinatorics» more COCOON 2010»

The Curse of Connectivity: t-Total Vertex (Edge) Cover

13 years 8 months ago

The Curse of Connectivity: t-Total Vertex (Edge) Cover

Download www.imsc.res.in

Henning Fernau, Fedor V. Fomin, Geevarghese Philip

Real-time Traffic

COCOON 2010 | Combinatorics |

claim paper

Related Content

» Vertex and Edge Covers with Clustering Properties Complexity and Algorithms

» Maintaining a Large Matching or a Small Vertex Cover

» The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number

» Bidimensionality and geometric graphs

» Linear Problem Kernels for NPHard Problems on Planar Graphs

» Boosted sampling approximation algorithms for stochastic optimization

» The Bidimensional Theory of BoundedGenus Graphs

» Local Graph Partitions for Approximation and Testing

» Robust Combinatorial Optimization with Exponential Scenarios

Post Info
More Details (n/a)

Added	15 Aug 2010
Updated	15 Aug 2010
Type	Conference
Year	2010
Where	COCOON
Authors	Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh

Comments (0)