Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements (2014)

First Author: Ene A
Attributed to:  The Centre for Discrete Mathematics and its Applications (DIMAP) funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1145/2591796.2591837

Publication URI: http://dx.doi.org/10.1145/2591796.2591837

Type: Conference/Paper/Proceeding/Abstract

ISBN: 9781450327107