Name
Abstract | ||
|---|---|---|
Abstract,1. Introduction We are given a set of points pl, . . . ,p. and a |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1145/195058.195125 | STOC |
Keywords | Field | DocType |
minimum latency problem,computational complexity | Approximation algorithm,Discrete mathematics,Average-case complexity,Asymptotic computational complexity,Combinatorics,Latency (engineering),Computer science,Scheduling (computing),Travelling salesman problem,Distance matrix,Triangle inequality | Conference |
ISBN | Citations | PageRank |
0-89791-663-8 | 122 | 18.61 |
References | Authors | |
9 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Avrim Blum | 1 | 7978 | 906.15 |
| Prasad Chalasani | 2 | 299 | 57.01 |
| Don Coppersmith | 3 | 4370 | 976.70 |
| Bill Pulleyblank | 4 | 122 | 18.61 |
| Prabhakar Raghavan | 5 | 13351 | 2776.61 |
| Madhu Sudan | 6 | 5616 | 591.68 |