Computing and Combinatorics
From MaRDI portal
Publication:5716995
DOI10.1007/11533719zbMath1128.90574OpenAlexW4376561447MaRDI QIDQ5716995
Luigi Laura, Luca Allulli, Giorgio Ausiello
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11533719
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25)
Related Items (7)
TSP race: minimizing completion time in time-sensitive applications ⋮ On the power of lookahead in online lot-sizing ⋮ Online TSP with known locations ⋮ An improved algorithm for open online dial-a-ride ⋮ Online Vehicle Routing Problems: A Survey ⋮ On the power of lookahead in on-line server routing problems ⋮ Almost sure asymptotic optimality for online routing and machine scheduling problems
This page was built for publication: Computing and Combinatorics
