In computer science and operations research, approximation algorithms are algorithms used to find approximate solutions to optimization problemsâ€¦Â (More)

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

Highly Cited

2009

Highly Cited

2009

- Marius Muja, David G. Lowe
- VISAPP
- 2009

For many computer vision problems, the most time consuming component consists of nearest neighbor matching in high-dimensionalâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Joel A. Tropp
- IEEE Transactions on Information Theory
- 2004

This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparseâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Frank Thomson Leighton, Satish Rao
- J. ACM
- 1999

In this paper, we establish max-flow min-cut theorems for several important classes of multicommodity flow problems. Inâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- David B. Shmoys, Ã‰va Tardos, Karen Aardal
- STOC
- 1997

Approximationalgorithmsfor facilitylocationproblemsÂ

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Sudipto Guha, Samir Khuller
- Algorithmica
- 1996

The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex isâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Michel X. Goemans, David P. Williamson
- J. ACM
- 1995

We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problemsâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- David B. Shmoys, Ã‰va Tardos
- Math. Program.
- 1993

The generalized assignment problem can be viewed as the following problem of scheduling parallel machines with costs. Each job isâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Michel X. Goemans, David P. Williamson
- SODA
- 1992

We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems ofâ€¦Â (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- Jan Karel Lenstra, David B. Shmoys, Ã‰va Tardos
- 28th Annual Symposium on Foundations of Computerâ€¦
- 1987

We consider the following scheduling problem. There are m parallel machines and n independent jobs. Each job is to be assigned toâ€¦Â (More)

Is this relevant?

Highly Cited

1976

Highly Cited

1976

- Sartaj Sahni, Teofilo F. Gonzalez
- J. ACM
- 1976

For P-complete problems such as traveling salesperson, cycle covers, 0-1 integer programming, multicommodity network flowsâ€¦Â (More)

Is this relevant?