On the star forest polytope for trees and cycles

DOI10.1051/ro/2018076zbMath1434.90162OpenAlexW2891698547MaRDI QIDQ5214329

Méziane Aïder, Viet Hung Nguyen, Lamia Aoudia, Mourad Baïou, Ali Ridha Mahjoub

Publication date: 7 February 2020

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2018076

zbMATH Keywords

combinatorial optimizationfacility locationdominating setpolyhedral combinatoricsstar forest

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Boolean-width of graphs
• One-node cutsets and the dominating set polytope
• On the dominating set polytope
• Minimum-Cost $$b$$-Edge Dominating Sets on Trees
• On Variants of the Spanning Star Forest Problem
• On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP
• An Improved Approximation Bound for Spanning Star Forest and Color Saving
• The Dominating Set Polytope via Facility Location
• Polytope Des Absorbants Dans Une Classe De Graphe a Seuil
• On the Integrality of Some Facility Location Polytopes
• Improved Approximation Algorithms for the Spanning Star Forest Problem
• Edge Dominating Sets in Graphs
• The maximum weight spanning star forest problem on cactus graphs
• Computing and Combinatorics

This page was built for publication: On the star forest polytope for trees and cycles