SOFSEM 2004: Theory and Practice of Computer Science
From MaRDI portal
Publication:5902007
DOI10.1007/b95046zbMath1202.68212OpenAlexW2916538296MaRDI QIDQ5902007
Rolf Niedermeier, Jiong Guo, Sebastian Wernicke, Jochen Alber, Jens Gramm
Publication date: 4 June 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95046
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
