The car sharing problem

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2011, Pages 167-175

  Briest, Patrick ^a   Raupach, Christoph ^a,b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b GOOGLE   (United Kingdom)

Author keywords

approximation algorithms; metric task systems; queuing networks

Indexed keywords

APX-HARDNESS; AVERAGE NUMBERS; EFFICIENT ALGORITHM; METRIC TASK SYSTEMS; QUEUING NETWORK; SERVICE PROVIDER; STOCHASTIC PROCESS;

BINS; MATHEMATICAL OPERATORS; NETWORK ARCHITECTURE; RANDOM PROCESSES;

APPROXIMATION ALGORITHMS;

EID: 79959652824     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989493.1989518     Document Type: Conference Paper

References (15)

1. Y. Azar. On-line Load Balancing. Theoretical Computer Science, 1992.
2. F. Baskett, K. Chandy, R. Muntz, and F. Palacios. Open, closed, and mixed networks of queues with different classes of customers. Journal of the ACM, 22, 1975.
3. G. Bolch, S. Greiner, H. Meer, and K. Trivedi. Queuing Networks and Markov Chains. John Wiley & Sons, 2006.
4. M. Englert, D. Özmen, and M. Westermann. The Power of Reordering for Online Minimum Makespan Scheduling. In Proc. of the 49th Symposium on Foundations of Computer Science (FOCS), 2008.
5. M. Gendreaub, G. Laportea, and R. Seguin. Stochastic Vehicle Routing. European Journal of Operational Research, 88(1), 1996.
6. W. Gordon and G. Newell. Closed Queuing Systems With Exponential Servers. Operations Research, 15, 1967.
7. E. Hazan, S. Safra, and O. Schwartz. On the Complexity of Approximating k - Set Packing. In Computational Complexity, 15, 2006.
8. J. Jackson. Jobshop-Like Queuing Systems. Management Science, 50, 2004.
9. E. Koutsoupias and C. Papadimitriou. On the k-Server Conjecture. Journal of the ACM, 42, 1995.
10. M. Manasse, L. McGeoch, and D. Sleator. Competitive Algorithms for Server Problems. Journal of Algorithms, 11(2), 1990.
11. M. Maxwell, M. Restrepo, S. Henderson, and H. Topaloglu. Approximate Dynamic Programming for Ambulance Redeployment. INFORMS Journal on Computing, 22(2), 2010.
12. Y. Peres, K. Talwar, and U. Wieder. The (1+β)-Choice Process and Weighted Balls-into-Bins. In Proc. of the 21st Symposium on Discrete Algorithms (SODA), 2010.
13. W. Powell. A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers. Transportation Science, 30(3), 1996.
14. M. Raab and A. Steger. "Balls into Bins" - A Simple and Tight Analysis. In Proc. of the 2nd Workshop on Randomization and Approximation Techniques in Computer Science, 1998.
15. M. Reiser and S. Lavenberg. Mean Value Analysis of Closed Multichain Queuing Networks. Journal of the ACM, 27, 1980.