SOFSEM 2004: Theory and Practice of Computer Science

DOI10.1007/B95046zbMath1202.68206OpenAlexW2916538296MaRDI QIDQ5902002

Panagiotis Stamatopoulos, Vassilios Zissimopoulos, Constantinos Halatsis, George Boukeas

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Measuring instance difficulty for combinatorial optimization problems

This page was built for publication: SOFSEM 2004: Theory and Practice of Computer Science