Files in this item

FilesDescriptionFormat

application/pdf

application/pdf8701642.pdf (5MB)Restricted to U of Illinois
(no description provided)PDF

Description

Title:Topics in Combinatorial Algorithms (Multicommodity Flows, Quadratic Programming)
Author(s):Vaidya, Pravin Moreshwar
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:Ph.D.
Genre:Dissertation
Subject(s):Computer Science
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.
Issue Date:1986
Type:Text
Description:164 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986.
URI:http://hdl.handle.net/2142/69567
Other Identifier(s):(UMI)AAI8701642
Date Available in IDEALS:2014-12-15
Date Deposited:1986


This item appears in the following Collection(s)

Item Statistics