Approximation and Online Algorithms
From MaRDI portal
Publication:5713437
DOI10.1007/b106130zbMath1124.90352MaRDI QIDQ5713437
Publication date: 14 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106130
68W40: Analysis of algorithms
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research
68W01: General topics in the theory of algorithms
Related Items