Login / Signup

Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems.

Mordecai J. GolinHadi KhodabandeBo Qin
Published in: ISAAC (2017)
Keyphrases
  • rough sets
  • application domains
  • problems involving
  • data sets
  • social networks
  • objective function
  • least squares
  • dynamic environments
  • approximation algorithms