Oblivious Integral Routing for Minimizing the Quadratic Polynomial Cost

DOI10.1007/978-3-319-08016-1_20zbMath1408.90300MaRDI QIDQ3188850

Yangguang Shi, Fa Zhang, Zhi-yong Liu

Publication date: 2 September 2014

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08016-1_20

zbMATH Keywords

competitive ratio; oblivious routing; hardness of approximation; randomization algorithm

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B18: Communication networks in operations research

90B10: Deterministic network models in operations research

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W20: Randomized algorithms

Related Items

Randomized oblivious integral routing for minimizing power cost