Bounded-degree rooted tree and TDI-Ness

DOI10.1051/RO/2022101MaRDI QIDQ5104597zbMATH OpenOpenAlexFDO

Authors Hervé L. M. Kerivin, Jinhua Zhao

Publication date 15 September 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

bounded-degree rooted treefacetspolytopetotal dual integrality

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Combinatorics in computer science (68R05) General topics in the theory of algorithms (68W01)

Recommendations

• A computational study on the maximum-weight bounded-degree rooted tree problem
• Optimizing constrained subtrees of trees
• Total dual integrality of matching forest constraints
• The Steiner tree polytope and related polyhedra
• scientific article; zbMATH DE number 795222

Cited in

(1)

• A computational study on the maximum-weight bounded-degree rooted tree problem

This page was built for publication: Bounded-degree rooted tree and TDI-Ness

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