Mathematical Foundations of Computer Science 2003
From MaRDI portal
Publication:5431308
DOI10.1007/b11836zbMath1124.68452MaRDI QIDQ5431308
Robert Benkoczi, Binay K. Bhattacharya, Lawrence L. Larmore, Wojciech Rytter, Marek Chrobak
Publication date: 7 December 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11836
Related Items
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks, Optimizing server placement in distributed systems in the presence of competition, Improved algorithms for computing minmax regret sinks on dynamic path and tree networks, Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees, A quadratic time exact algorithm for continuous connected 2-facility location problem in trees