{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/10533"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/10533","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Cut structures and randomized algorithms in edge-connectivity problems","abstract":"Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.","abstract_html":"Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.","abstract_has_math":false,"creators":["Benczúr, András A"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Mathematics","school":null,"contributors":[],"advisors":["Michel X. Goemans."],"committee_chairs":[],"committee_members":[],"year":1997,"date_issued":"1997","date_published":"1997","updated_at":"2026-07-22T22:21:32Z","subjects":["Mathematics"],"languages":["eng"],"rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/10533","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Michel X. Goemans."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Mathematics"]},{"key":"dc:creator","label":"Author","values":["Benczúr, András A"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2005-08-18T21:26:37Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2005-08-18T21:26:37Z"]},{"key":"dc:date.issued","label":"Date","values":["1997"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/10533"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.","Includes bibliographical references (leaves 195-202"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph.D."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Cut structures and randomized algorithms in edge-connectivity problems"]}]}],"canonical_facts":{"dc:contributor.advisor":["Michel X. Goemans."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Mathematics"],"dc:creator":["Benczúr, András A"],"dc:date.accessioned":["2005-08-18T21:26:37Z"],"dc:date.available":["2005-08-18T21:26:37Z"],"dc:date.issued":["1997"],"dc:description":["Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.","Includes bibliographical references (leaves 195-202"],"dc:description.degree":["Ph.D."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/1721.1/10533"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Mathematics"],"dc:title":["Cut structures and randomized algorithms in edge-connectivity problems"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:32Z"}