The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths.
Robert GanianSebastian OrdyniakPublished in: Algorithmica (2021)
Keyphrases
- disjoint paths
- approximation algorithms
- directed graph
- undirected graph
- expectation maximization
- input parameters
- sensitivity analysis
- parameter values
- maximum likelihood
- parameter estimation
- edge detector
- fine tuning
- maximum likelihood estimation
- parameter settings
- learning algorithm
- power consumption
- input data
- dynamic programming