Variable sized online interval coloring with bandwidth
DOI10.1007/s00453-007-9071-0zbMath1172.68059OpenAlexW2031307298MaRDI QIDQ1024785
Leah Epstein, Asaf Levin, Erlebach, Thomas
Publication date: 17 June 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.2449
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An on-line algorithm for variable-sized bin packing
- An improved algorithm for online coloring of intervals with bandwidth
- Bin packing can be solved within 1+epsilon in linear time
- On the competitiveness of on-line real-time task scheduling
- An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing
- On the online bin packing problem
- Variable Sized Bin Packing
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- A simple on-line bin-packing algorithm
- The Linearity of First-Fit Coloring of Interval Graphs
- On some packing problem related to dynamic storage allocation
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Computing and Combinatorics
- New Bounds for Variable-Sized Online Bin Packing
- On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $
- Mathematical Foundations of Computer Science 2005
- Toeplitz Matrices Associated with a Semi-Infinite Laurent Series
- Automata, Languages and Programming
- Approximation and Online Algorithms
This page was built for publication: Variable sized online interval coloring with bandwidth
