The Lazy Bureaucrat scheduling problem-Reference-Cited by-同舟云学术

The Lazy Bureaucrat scheduling problem

Published:2003-07 Issue:1 Volume:184 Page:129-146
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Arkin Esther M.,Bender Michael A.,Mitchell Joseph S.B.,Skiena Steven S.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference15 articles.

1. The Lazy Bureaucrat scheduling problem;Arkin,1999

2. A. Bar-Noy, S. Guha, J. Naor, B. Schieber, Approximating the throughput of real-time multiple machine scheduling, in: Proceedings of the 31st ACM Symposium Theory of Computing (STOC), 1999, pp. 622–631

3. The maximum traveling salesman problem under polyhedral norms;Barvinok,1998

4. S.P. Fekete, Simplicity and hardness of the maximum traveling salesman problem under geometric distances, in: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999, pp. 337–345

5. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

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

1. Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation;Theoretical Computer Science;2022-06

2. (In)approximability of maximum minimal FVS;Journal of Computer and System Sciences;2022-03

3. Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximation;Lecture Notes in Computer Science;2021

4. Assessment of probable scenarios of radiological emergency and their consequences;International Journal of Radiation Biology;2020-08-03

5. The many facets of upper domination;Theoretical Computer Science;2018-03