Skip to search formSkip to main contentSemantic Scholar

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

2007

Highly Cited

2007

We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

Given a point set P ⊆ R<sup>d</sup> the k-means clustering problem is to find a set C=(c<sub>1</sub>,...,c<sub>k</sub>) of k… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

A disk graph is the intersection graph of a set of disks with arbitrary diameters in the plane. For the case that the disk… Expand

Is this relevant?

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

Is this relevant?

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

Is this relevant?

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

Is this relevant?

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

Is this relevant?

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

Is this relevant?

Highly Cited

1997

Highly Cited

1997

The d-dimensional vector packing problem is a well-known generalization of the classical bin packing problem: For a given list of… Expand

Is this relevant?

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

Is this relevant?