Interval selection: Applications, algorithms, and lower bounds
暂无分享,去创建一个
[1] Rudolf Müller,et al. Optimization in electronic markets: examples in combinatorial auctions , 2001 .
[2] Sandy Irani,et al. Bounding the power of preemption in randomized scheduling , 1995, STOC '95.
[3] Gerhard J. Woeginger,et al. On-Line Scheduling of Jobs with Fixed Start and End Times , 1994, Theor. Comput. Sci..
[4] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[5] Frits C. R. Spieksma,et al. Simple Algorithms for a Weighted Interval Selection Problem , 2000, ISAAC.
[6] Piotr Berman,et al. Aligning two fragmented sequences , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.
[7] Eric Torng. A Unified Analysis of Paging and Caching , 1998, Algorithmica.
[8] André Seznec. A New Case for Skewed-Associativity , 1997 .
[9] Rajeev Raman,et al. Priority Queues: Small, Monotone and Trans-dichotomous , 1996, ESA.
[10] Errol L. Lloyd,et al. on the K-coloring of Intervals , 1991, Discrete Applied Mathematics.
[11] Rafail Ostrovsky,et al. Approximation algorithms for the job interval selection problem and related scheduling problems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[12] Michael H. Goldwasser. Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control , 1999, SODA '99.
[13] Michael L. Fredman,et al. Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths , 1994, J. Comput. Syst. Sci..
[14] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[15] Mikkel Thorup,et al. Undirected single-source shortest paths with positive integer weights in linear time , 1999, JACM.
[16] Frits C. R. Spieksma,et al. Interval selection: applications, algorithms and lower bounds , 2002 .
[17] Errol L. Lloyd,et al. On the k -coloring of intervals , 1995 .
[18] Mihalis Yannakakis,et al. The Maximum k-Colorable Subgraph Problem for Chordal Graphs , 1987, Inf. Process. Lett..
[19] Subhash Suri,et al. Online Scheduling with Hard Deadlines , 2000, J. Algorithms.
[20] Giorgio Gambosi,et al. Complexity and Approximation , 1999, Springer Berlin Heidelberg.
[21] Giorgio Gambosi,et al. Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .
[22] Leo G. Kroon,et al. Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem , 1997, Oper. Res..
[23] Robert E. Tarjan,et al. A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..
[24] Ronald M. Harstad,et al. Computationally Manageable Combinational Auctions , 1998 .
[25] Sudipto Guha,et al. Approximating the Throughput of Multiple Machines in Real-Time Scheduling , 2002, SIAM J. Comput..
[26] Matteo Fischetti,et al. Approximation Algorithms for Fixed Job Schedule Problems , 1992, Oper. Res..
[27] Piotr Berman,et al. Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling , 2000, J. Comb. Optim..
[28] Rajeev Motwani,et al. Randomized algorithms , 1996, CSUR.
[29] Bar-NoyAmotz,et al. A unified approach to approximating resource allocation and scheduling , 2001 .
[30] O. E. Flippo,et al. The assembly of printed circuit boards : a case with multiple machines and multiple board types , 1995 .
[31] Reuven Bar-Yehuda,et al. A unified approach to approximating resource allocation and scheduling , 2001, JACM.
[32] F. Spieksma. On the approximability of an interval scheduling problem , 1999 .