Author:
Alicherry Mansoor,Bhatia Randeep
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Bar-Noy, A., Bellare, M., Halldorsson, M.M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Information and Computation 140, 183–202 (1998)
2. Bar-Noy, A., Kortsarz, G.: The minimum color-sum of bipartite graphs. Journal of Algorithms 28, 339–365 (1998)
3. Cosares, S., Saniee, I.: An Optimization Problem Related to Balancing Loads on SONET Rings. Telecommunication Systems 3(2), 165–181 (1994)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman Publication, New York (1979)
5. Garey, M.R., Johnson, D.S., Miller, G.L., Papadimitriou, C.H.: The complexity of coloring circular arcs and chords. SIAM Journal on Algebraic and Discrete Methods 1(2), 216–227 (1980)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Busy-Time Scheduling on Heterogeneous Machines: Algorithms and Analysis;IEEE Transactions on Parallel and Distributed Systems;2022-12-01
2. Dynamic Bin Packing with Predictions;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2022-12
3. Generalized Skyline Interval Coloring and Dynamic Geometric Bin Packing Problems;50th International Conference on Parallel Processing;2021-08-09
4. Analysis of Busy-Time Scheduling on Heterogeneous Machines;Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures;2021-07-06
5. Online Virtual Machine Allocation with Lifetime and Load Predictions;ACM SIGMETRICS Performance Evaluation Review;2021-06-22