Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2012

Review

2008

Review

2008

Approximation algorithms and parameterized complexity are usually considered to be two separate ways of dealing with hard… Expand

Highly Cited

2006

Highly Cited

2006

Frieze et al. [17] proved that a small sample of rows of a given matrix <i>A</i> contains a low-rank approximation <i>D</i> that… Expand

Highly Cited

2004

Highly Cited

2004

Assuming that NP /spl nsube//spl cap//sub /spl epsi/> 0/ BPTIME(2/sup n/spl epsi//), we show that graph min-bisection, densest… Expand

Highly Cited

2004

Highly Cited

2004

We consider the following clustering problem: we have a complete graph on n vertices (items), where each edge (u, v) is labeled… Expand

Highly Cited

2003

Highly Cited

2003

We study the combinatorial structure and computational complexity of extreme Nash equilibria, ones that maximize or minimize a… Expand

Highly Cited

2003

Highly Cited

2003

A connected dominating set in a graph is a subset of vertices such that every vertex is either in the subset or adjacent to a… Expand

Highly Cited

2000

Highly Cited

2000

The Multiple Knapsack problem (MKP) is a natural and well known generalization of the single knapsack problem and is defined as… Expand

Highly Cited

1999

Highly Cited

1999

We show that any polygonal subdivision in the plane can be converted into an "m-guillotine" subdivision whose length is at most… Expand

Highly Cited

1978

Highly Cited

1978

We consider one of the basic, well-studied problems of scheduling theory, that of nonpreemptively scheduling n independent tasks… Expand