Continuous reductions among combinatorial optimization problems

DOI10.1007/BF00289161zbMath0659.68092MaRDI QIDQ1112622

Hans Ulrich Simon

Publication date: 1989

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationapproximation algorithmlogic synthesisNP- completenesscombinatorial circuitscontinuous reductions

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Applications of graph theory to circuits and networks (94C15) Algorithms in computer science (68W99)

Related Items (1)

Max NP-completeness made easy

Cites Work

• An Efficient Heuristic Procedure for Partitioning Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Continuous reductions among combinatorial optimization problems