Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights.
Igor AverbakhOded BermanMarina LealPublished in: Discret. Appl. Math. (2018)
Keyphrases
- network size
- linear complexity
- worst case
- social networks
- computational complexity
- improved algorithm
- average degree
- vapnik chervonenkis dimension
- edge weights
- network design
- computer networks
- directed graph
- back propagation
- network model
- linear model
- space complexity
- weighted sum
- relative importance
- computationally efficient
- linear combination
- computational cost
- artificial neural networks
- neural network
- real time