A polyhedral view to generalized multiple domination and limited packing

DOI10.1007/978-3-319-96151-4_30MaRDI QIDQ1661908zbMATH OpenOpenAlexFDO

Authors José Neto

Publication date 17 August 2018

Full work available at URL https://doi.org/10.1007/978-3-319-96151-4_30

Mathematics Subject Classification ID

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

Recommendations

• The multiple domination and limited packing problems in graphs
• Limited packing and multiple domination problems: polynomial time reductions
• A polyhedral view to a generalization of multiple domination
• Polynomial reductions between the limited packing and tuple domination problems in graphs
• A polyhedral study of the generalized vertex packing problem
• scientific article; zbMATH DE number 706830
• On finite multiple packings
• scientific article; zbMATH DE number 6837043
• Plotkin bound generalization to the case of multiple packings
• Packing and domination parameters in digraphs

Cited in

(5)

• A polyhedral view to a generalization of multiple domination
• Decomposition of Multiple Packings with Subquadratic Union Complexity
• The dominating set polytope via facility location
• On \(f\)-domination: polyhedral and algorithmic results
• Polynomial reductions between the limited packing and tuple domination problems in graphs

This page was built for publication: A polyhedral view to generalized multiple domination and limited packing

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