Delay-constrained minimum shortest path trees and related problems

DOI10.1016/j.tcs.2022.11.014OpenAlexW4309149619MaRDI QIDQ5925589

Suding Liu, Wencheng Wang, Pengxiang Pan, Lijian Cai, Jianping Li, Junran Lichen

Publication date: 4 January 2023

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.11.014

zbMATH Keywords

complexitycombinatorial optimizationdelay-constrained minimum shortest path treesdiameter-constrained minimum shortest path treesexact algorithms in polynomial time

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• A note on two problems in connexion with graphs
• When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem
• On the minimum diameter spanning tree problem
• Approximating the weight of shallow Steiner trees
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A hybrid heuristic for the diameter constrained minimum spanning tree problem
• Bounded-diameter minimum-cost graph problems
• Geometric Minimum Diameter Minimum Cost Spanning Tree Problem
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Minimum Diameter Spanning Trees and Related Problems
• Finding Minimum Spanning Trees
• The absolute center of a network
• An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection
• Discrete-Variable Extremum Problems
• Greedy heuristics for the bounded diameter minimum spanning tree problem
• Optimum branchings
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Combinatorial optimization. Theory and algorithms.
• Delay-constrained minimum shortest path trees and related problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Delay-constrained minimum shortest path trees and related problems