Join Our Newsletter

COCOON

2003

Springer

10 years 3 months ago
2003

Springer

We design eﬃcient competitive algorithms for discovering hidden information using few queries. Speciﬁcally, consider a game in a given set of intervals (and their implied inte...

MFCS

2004

Springer

10 years 4 months ago
2004

Springer

We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...

APPROX

2004

Springer

10 years 4 months ago
2004

Springer

ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...

WG

2005

Springer

10 years 4 months ago
2005

Springer

We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...

WEA

2005

Springer

10 years 4 months ago
2005

Springer

This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...

APPROX

2005

Springer

10 years 4 months ago
2005

Springer

We consider the problem of ﬁnding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...

COCO

2009

Springer

10 years 5 months ago
2009

Springer

We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...