Online Coloring of Intervals with Bandwidth-Reference-Cited by-同舟云学术

Online Coloring of Intervals with Bandwidth

Published:2004 Issue: Volume: Page:1-12
ISSN:0302-9743
Container-title:Approximation and Online Algorithms
language:
Short-container-title:

Author:

Adamy Udo,Erlebach Thomas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24592-6_1

Reference12 articles.

1. Bartal, Y., Leonardi, S.: On-line routing in all-optical networks. Theoretical Computer Science 221(1-2), 19–39 (1999)

2. Beauquier, B., Bermond, J.-C., Gargano, L., Hell, P., Perennes, S., Vaccaro, U.: Graph problems arising from wavelength-routing in all-optical networks. In: Proceedings of the Second Workshop on Optics and Computer Science (WOCS), part of IPPS 1997 (1997)

3. Chrobak, M., Ślusarek, M.: On some packing problems related to dynamic storage allocation. RAIRO Informatique Théoretique et Applications 22, 487–499 (1988)

4. Lecture Notes in Computer Science;T. Erlebach,1997

5. Feldmann, A.: On-line call admission for high-speed networks (Ph.D. Thesis). Technical Report CMU-CS-95-201, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA (1995)

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

1. Station Assignment with Reallocation;Algorithmica;2018-05-30

2. Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals;Combinatorial Optimization and Applications;2017

3. A Tight Analysis of Kierstead-Trotter Algorithm for Online Unit Interval Coloring;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2016

4. Station Assignment with Reallocation;Experimental Algorithms;2015

5. On the max coloring problem;Theoretical Computer Science;2012-11