Login / Signup
Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems.
Mordecai J. Golin
Hadi Khodabande
Bo Qin
Published in:
CoRR (2017)
Keyphrases
</>
databases
np complete
dynamic environments
neural network
problems involving
social networks
image segmentation
bayesian networks
multi objective
optimization problems
approximation algorithms
network flow problem