Linear programming complementation

DOI10.1016/J.TCS.2025.115087MaRDI QIDQ7021856zbMATH OpenFDO

Authors Maximilien Gadouleau, George B. Mertzios, Victor Zamaraev

Publication date 26 February 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115087

zbMATH Keywords

dualityfractional dominating numberfractional vertex coverhypergraphlinear programming

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Linear programming (90C05)

Cites work

• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Deploying robots with two sensors in \(K_{1,6}\)-free graphs
• Fractional domatic, idomatic, and total domatic numbers of a graph
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3562833 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• scientific article; zbMATH DE number 194981 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 5047784 (Why is no real title available?)
• On the ratio of optimal integral and fractional covers
• The ellipsoid method and its consequences in combinatorial optimization
• Tight lower bounds for the complexity of multicoloring

This page was built for publication: Linear programming complementation

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