The (K,k)-Capacitated Spanning Tree Problem

DOI10.1007/978-3-642-14355-7_4MaRDI QIDQ3578356zbMATH OpenOpenAlexFDO

Authors Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin

Publication date 20 July 2010

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14355-7_4

Mathematics Subject Classification ID

Approximation algorithms (68W25) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The \((K, k)\)-capacitated spanning tree problem
• On the SPANNING k-TREE problem
• The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
• A branch and bound algorithm for the capacitated minimum spanning tree problem
• The multilevel capacitated minimum spanning tree problem
• A Polyhedral Intersection Theorem for Capacitated Spanning Trees
• The capacitated minimum spanning tree problem: On improved multistar constraints
• An exact algorithm for the capacitated shortest spanning arborescence
• The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
• Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design

Cited in

(4)

• The \((K, k)\)-capacitated spanning tree problem
• scientific article; zbMATH DE number 3963210 (Why is no real title available?)
• A Polyhedral Intersection Theorem for Capacitated Spanning Trees
• On the SPANNING k-TREE problem

This page was built for publication: The (K,k)-Capacitated Spanning Tree Problem

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