Brief Announcement-Reference-Cited by-同舟云学术

Brief Announcement

Published:2018-07-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Kumar Saurabh¹,Khuller Samir²

Affiliation:

1. Google, Mountain View, CA, USA

2. University of Maryland, College Park, MD, USA

Funder

National Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3210377.3210659

Reference6 articles.

1. Restrictions of graph partition problems. Part I

2. A Model for Minimizing Active Processor Time

3. Jessica Chang Samir Khuller and Koyel Mukherjee . 2014. LP rounding and combinatorial algorithms for minimizing active and busy time Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures. ACM 118--127. 10.1145/2612669.2612689 Jessica Chang Samir Khuller and Koyel Mukherjee . 2014. LP rounding and combinatorial algorithms for minimizing active and busy time Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures. ACM 118--127. 10.1145/2612669.2612689

4. Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs

5. Saurabh Kumar . 2016. Combinatorial Algorithms for the Active Time and Busy Time Problems. Master's thesis. bibinfoschoolUniversity of Maryland College Park. Saurabh Kumar . 2016. Combinatorial Algorithms for the Active Time and Busy Time Problems. Master's thesis. bibinfoschoolUniversity of Maryland College Park.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Brief Announcement: Nested Active-Time Scheduling;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11

2. Balancing Flow Time and Energy Consumption;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11

3. Active and Busy Time Scheduling Problem: A Survey;Complexity and Approximation;2020