Vertex sparsification and universal rounding algorithms

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011. === Cataloged from PDF version of thesis. === Includes bibliographical references (p. 125-129). === Suppose we are given a gigantic communication network, but are only interested in a...

Full description

Bibliographic Details
Main Author: Moitra, Ankur
Other Authors: F. Thomson Leighton.
Format: Others
Language:English
Published: Massachusetts Institute of Technology 2011
Subjects:
Online Access:http://hdl.handle.net/1721.1/66019