Oblivious Integral Routing for Minimizing the Quadratic Polynomial Cost

DOI10.1007/978-3-319-08016-1_20zbMath1408.90300OpenAlexW203247646MaRDI 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 ratiooblivious routinghardness of approximationrandomization algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

Related Items (1)

Randomized oblivious integral routing for minimizing power cost

This page was built for publication: Oblivious Integral Routing for Minimizing the Quadratic Polynomial Cost