On Approximating Degree-Bounded Network Design Problems.

Xiangyu Guo Guy Kortsarz Bundit Laekhanukit Shi Li Daniel Vaz Jiayi Xian

Published in: Algorithmica (2022)

Keyphrases

network design problem
approximation algorithms
network design
network flow problem
capacitated fixed charge
mixed integer
valid inequalities
minimal cost
np hard
simulated annealing
branch and bound
integer programming