Automata, Languages and Programming
From MaRDI portal
Publication:5466456
DOI10.1007/b99859zbMath1098.68008OpenAlexW2505584480MaRDI QIDQ5466456
Lisa Zhang, Matthew T. Andrews
Publication date: 24 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99859
Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
Path multicoloring with fewer colors in spiders and caterpillars ⋮ Wavelength assignment in multifiber star networks
