Characterizing demand graphs for (fixed-parameter) shallow-light Steiner network

DOI10.4230/LIPICS.FSTTCS.2018.33MaRDI QIDQ5090972FDOQ5090972

Authors: Amy Babay, Michael Dinitz, Ze Yu Zhang 

Publication date: 21 July 2022

Recommendations

• Brief announcement: Characterizing demand graphs for (fixed-parameter) shallow-light Steiner network
• The complexity landscape of fixed-parameter directed Steiner network problems
• Network design problems with bounded distances via shallow-light Steiner trees
• Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees

zbMATH Keywords

network designfixed-parameter tractabledemand graphsshallow-light Steiner network

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites Work

• Reachability preservers: new extremal bounds and approximation algorithms

This page was built for publication: Characterizing demand graphs for (fixed-parameter) shallow-light Steiner network

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