Combinatorial problems over power sets

DOI10.1007/BF02576644MaRDI QIDQ1143948zbMATH OpenFDO

Authors Marco Protasi, Giorgio Ausiello, Alberto Marchetti-Spaccamela

Publication date 1979

Published in Calcolo (Search for Journal in Brave)

zbMATH Keywords

NP-complete optimization problemscombinatorial problems over power setsstructure of a combinatorial problemstructure preserving reductions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mathematical programming (90C99)

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3551892 (Why is no real title available?)
• scientific article; zbMATH DE number 3557234 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Node-Deletion NP-Complete Problems
• On the complexity of the maximum subgraph problem
• Structure preserving reductions among convex optimization problems
• The Complexity of Enumeration and Reliability Problems
• The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
• The complexity of computing the permanent

Cited in

(1)

• Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems

This page was built for publication: Combinatorial problems over power sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1143948)