|
1375
|
Randomized Algorithms
– Motwani, Raghavan
- 1995
|
|
466
|
Online Computation and Competitive Analysis
– Borodin, El-Yaniv
- 1998
|
|
436
|
Approximation algorithms for NP-hard problems
– Hochbaum
- 1997
|
|
147
|
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
– Ausiello, Crescenzi, et al.
- 1999
|
|
141
|
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
– Fredman, Willard
- 1994
|
|
130
|
A linear-time algorithm for a special case of disjoint set union
– Gabow, Tarjan
- 1985
|
|
64
|
Undirected single-source shortest paths with positive integer weights in linear time
– Thorup
- 1999
|
|
45
|
Approximating the throughput of multiple machines in real-time scheduling
– Bar-Noy, Guha, et al.
- 1999
|
|
43
|
Computationally manageable combinational auctions
– Rothkopf, Pekec, et al.
- 1998
|
|
35
|
Priority queues: Small, monotone and trans-dichotomous
– Raman
- 1996
|
|
33
|
A unified approach to approximating resource allocation and scheduling
– Bar-Noy, Bar-Yehuda, et al.
- 2000
|
|
30
|
On-line scheduling with hard deadlines
– Goldman, Parwatikar, et al.
- 2000
|
|
25
|
On the k-coloring of intervals
– Carlisle, Lloyd
- 1995
|
|
21
|
On-line scheduling of jobs with fixed start and end times
– Woeginger
- 1994
|
|
20
|
Multi-phase algorithms for throughput maximization for real-time scheduling
– Berman, DasGupta
- 2000
|
|
20
|
The assembly of printed circuit boards: A case with multiple machines and multiple board types
– Crama, Flippo, et al.
- 1997
|
|
20
|
The maximum k-colorable subgraph problem for chordal graphs
– Yannakakis, Gavril
- 1987
|
|
19
|
On the approximability of an interval scheduling problem
– Spieksma
- 1999
|
|
19
|
A unified analysis of paging and caching
– Torng
- 1998
|
|
12
|
On the Power of Preemption in Randomized Scheduling
– Canetti, Irani
- 1995
|
|
12
|
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
– Chuzhoy, Ostrovsky, et al.
- 2001
|
|
11
|
Some polynomial algorithms for certain graphs and hypergraphs
– Frank
- 1975
|
|
9
|
A new case for skewed-associativity
– Seznec
- 1997
|
|
5
|
Simple algorithms for a weighted interval selection problem
– Erlebach, Spieksma
- 2000
|
|
4
|
Approximation algorithms for fixed job schedule problems
– Fischetti, Martello, et al.
- 1992
|
|
4
|
Optimization in electronic markets: examples in combinatorial auctions
– Hoesel, Müller
- 2001
|
|
3
|
Patience is a virtue: the e#ect of slack on competitiveness for admission control
– Goldwasser
- 1999
|
|
3
|
Aligning two fragmented sequences
– Berman, Zhang, et al.
- 1999
|
|
2
|
Wassenhove. Exact and approximation algorithms for the tactical fixed interval scheduling problem
– Kroon, Salomon, et al.
- 1997
|
|
