Files in this item
|(no description provided)|
|Title:||Topics in Combinatorial Algorithms (Multicommodity Flows, Quadratic Programming)|
|Author(s):||Vaidya, Pravin Moreshwar|
|Department / Program:||Computer Science|
|Degree Granting Institution:||University of Illinois at Urbana-Champaign|
|Abstract:||This thesis is a study of a wide variety of combinatorial optimization problems.
In chapters two and three the problems of finding minimum weight matchings and minimum spanning trees on points in space are investigated and fast approximation algorithms are presented for both the problems. A key idea is to exploit the geometry underlying these problems.
In chapter four an optimal algorithm for the All-Nearest-Neighbors problem is described.
In chapter five we develop polynomial time approximation schemes for a generalization of bin packing where some items may be left unpacked and there is a penalty associated with each unpacked item.
In chapter six we investigate the trade-off between storage space and retrieval time for orthogonal range query on a static data base. Lower bounds on the product of space and time are obtained.
In the last chapter we develop fast algorithms for convex quadratic programming and multicommodity flows.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986.
|Date Available in IDEALS:||2014-12-15|