{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/69567"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/69567","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Topics in Combinatorial Algorithms (Multicommodity Flows, Quadratic Programming)","abstract":"This thesis is a study of a wide variety of combinatorial optimization problems.","abstract_html":"This thesis is a study of a wide variety of combinatorial optimization problems.","abstract_has_math":false,"creators":["Vaidya, Pravin Moreshwar"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-15T19:25:51Z","date_published":"2014-12-15T19:25:51Z","updated_at":"2026-07-22T22:26:01Z","subjects":["Computer Science"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI8701642"],"render_values":[{"text":"(UMI)AAI8701642","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/69567","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Vaidya, Pravin Moreshwar"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-15T19:25:51Z","10000-01-01","1986"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/69567","(UMI)AAI8701642"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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.","Made available in DSpace on 2014-12-15T19:25:51Z (GMT). No. of bitstreams: 1 8701642.pdf: 5108842 bytes, checksum: 8071d3969bcd22596dbf9f50061125c9 (MD5) Previous issue date: 1986","Embargo set by: Seth Robbins for item 69733 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","164 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986."]},{"key":"dc:title","label":"Title","values":["Topics in Combinatorial Algorithms (Multicommodity Flows, Quadratic Programming)"]}]}],"canonical_facts":{"dc:creator":["Vaidya, Pravin Moreshwar"],"dc:date":["2014-12-15T19:25:51Z","10000-01-01","1986"],"dc:description":["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.","Made available in DSpace on 2014-12-15T19:25:51Z (GMT). No. of bitstreams: 1 8701642.pdf: 5108842 bytes, checksum: 8071d3969bcd22596dbf9f50061125c9 (MD5) Previous issue date: 1986","Embargo set by: Seth Robbins for item 69733 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","164 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986."],"dc:identifier":["http://hdl.handle.net/2142/69567","(UMI)AAI8701642"],"dc:subject":["Computer Science"],"dc:title":["Topics in Combinatorial Algorithms (Multicommodity Flows, Quadratic Programming)"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:01Z"}