Login / Signup
Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity.
David Adjiashvili
Felix Hommelsheim
Moritz Mühlenthaler
Published in:
CoRR (2019)
Keyphrases
</>
graph connectivity
network design problem
approximation algorithms
network design
weighted graph
network flow problem
dynamic programming
neural network
evolutionary algorithm
branch and bound
mixed integer programming
valid inequalities
minimal cost
column generation
lagrangian relaxation
multistage
feature space