Reoptimization of Minimum Latency problem

DOI10.1007/978-3-319-62389-4_14zbMath1434.90166OpenAlexW2728584279MaRDI QIDQ2412408

Wenkai Dai

Publication date: 23 October 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-62389-4_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

Robust reoptimization of Steiner trees ⋮ Unnamed Item

This page was built for publication: Reoptimization of Minimum Latency problem