Automata, Languages and Programming
From MaRDI portal
Publication:5716861
DOI10.1007/11523468zbMath1085.68005OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716861
Martin Skutella, Fabrizio Grandoni, Gianpaolo Oriolo, Friedrich Eisenbrand
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (3)
Design of trees in the hose model: the balanced case ⋮ Connected facility location via random facility sampling and core detouring ⋮ Hardness of robust network design
This page was built for publication: Automata, Languages and Programming
