The Number of Solutions Sufficient for Solving a Family of Problems

DOI10.1287/MOOR.1050.0161MaRDI QIDQ5387953zbMATH OpenOpenAlexFDO

Authors Ori Einstein, Refael Hassin

Publication date 27 May 2008

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.1050.0161

zbMATH Keywords

algebraic combinatoricscut treeextremal combinatoricsfamily of problemshypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 403955
• Properties of solutions of optimization problems for set functions
• Introduction to the Maximum Solution Problem
• Relation between the hardness of a problem and the number of its solutions
• Seven problems: so different yet close

Cited in

(4)

• Algebraic properties of modulo q complete -wide families
• scientific article; zbMATH DE number 403955 (Why is no real title available?)
• Relation between the hardness of a problem and the number of its solutions
• Flow trees for vertex-capacitated networks

This page was built for publication: The Number of Solutions Sufficient for Solving a Family of Problems

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