A note on the depth function of combinatorial optimization problems

DOI10.1016/S0166-218X(00)00242-0zbMath0971.68071OpenAlexW2124975175MaRDI QIDQ5929316

Gerhard J. Woeginger

Publication date: 30 October 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00242-0

zbMATH Keywords

computational complexitydiscrete optimization problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• On the depth of combinatorial optimization problems
• Cooling Schedules for Optimal Annealing

This page was built for publication: A note on the depth function of combinatorial optimization problems