On spectrum assignment in elastic optical tree-networks
From MaRDI portal
Publication:1730219
DOI10.1016/j.dam.2018.09.021zbMath1407.68053OpenAlexW1566290388WikidataQ129022372 ScholiaQ129022372MaRDI QIDQ1730219
Fatima Zahra Moataz, Jean-Claude Bermond
Publication date: 11 March 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01962617/file/elasticDAMpreprintsubmission.pdf
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Internet topics (68M11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The edge intersection graphs of paths in a tree
- Edge and vertex intersection of paths in a tree
- Intersection graphs of paths in a tree
- A polynomial time approximation algorithm for dynamic storage allocation
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations
- An approximation result for the interval coloring problem on claw-free chordal graphs
- Algorithmic graph theory and perfect graphs
- An approximation algorithm for scheduling on three dedicated machines
- On the interval chromatic number of proper interval graphs
- Representing edge intersection graphs of paths on degree 4 trees
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Approximating interval coloring and max-coloring in chordal graphs
- The Linearity of First-Fit Coloring of Interval Graphs
- On some packing problem related to dynamic storage allocation
- Approximation algorithms for dynamic storage allocation
- OPTVersusLOADin Dynamic Storage Allocation
- Computing and Combinatorics
This page was built for publication: On spectrum assignment in elastic optical tree-networks
