Delay-constrained minimum shortest path trees and related problems

DOI10.1007/978-3-030-92681-6_53OpenAlexW4206588173MaRDI QIDQ5918729

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

Publication date: 29 June 2022

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_53

zbMATH Keywords

distancescomplexitycombinatorial optimizationexact algorithmsdelay-constrained shortest path trees

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Delay-constrained minimum shortest path trees and related problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• On the minimum diameter spanning tree problem
• Approximating the weight of shallow Steiner trees
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Geometric Minimum Diameter Minimum Cost Spanning Tree Problem
• Minimum Diameter Spanning Trees and Related Problems
• Finding Minimum Spanning Trees
• The absolute center of a network
• 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.

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