Topology reconstruction using time series data in telecommunication networks

DOI10.1002/net.22196OpenAlexW4389083833MaRDI QIDQ6196883

Unnamed Author, David Pisinger

Publication date: 15 March 2024

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22196

zbMATH Keywords

dynamic programmingvariable neighborhood searchphylogenetic treesmaximum parsimonynetwork reconstructiontelecommunication network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• The computational complexity of inferring rooted phylogenies by parsimony
• The Steiner problem in phylogeny is NP-complete
• Variable neighborhood search
• Distance realization problems with applications to internet tomography
• Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
• Network tomography: recent developments
• Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data
• Minimal Mutation Trees of Sequences
• A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
• The minimum evolution problem: Overview and classification
• Network Tomography Based on Additive Metrics

This page was built for publication: Topology reconstruction using time series data in telecommunication networks