Computing Exact Minimum Cuts Without Knowing the Graph
Author(s): Rubinstein, Aviad; Schramm, Tselil; Weinberg, S Matthew
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr1v841
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Rubinstein, Aviad | - |
dc.contributor.author | Schramm, Tselil | - |
dc.contributor.author | Weinberg, S Matthew | - |
dc.date.accessioned | 2021-10-08T19:47:58Z | - |
dc.date.available | 2021-10-08T19:47:58Z | - |
dc.date.issued | 2018 | en_US |
dc.identifier.citation | Rubinstein, Aviad, Tselil Schramm, and S. Matthew Weinberg. "Computing Exact Minimum Cuts Without Knowing the Graph." In 9th Innovations in Theoretical Computer Science Conference (ITCS) (2018): 39:1-39:16. doi:10.4230/LIPIcs.ITCS.2018.39 | en_US |
dc.identifier.issn | 1868-8969 | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/pr1v841 | - |
dc.description.abstract | We give query-efficient algorithms for the global min-cut and the s-t cut problem in unweighted, undirected graphs. Our oracle model is inspired by the submodular function minimization problem: on query S \subset V, the oracle returns the size of the cut between S and V \ S. We provide algorithms computing an exact minimum $s$-$t$ cut in $G$ with ~{O}(n^{5/3}) queries, and computing an exact global minimum cut of G with only ~{O}(n) queries (while learning the graph requires ~{\Theta}(n^2) queries). | en_US |
dc.format.extent | 39:1 - 39:16 | en_US |
dc.language.iso | en_US | en_US |
dc.relation.ispartof | 9th Innovations in Theoretical Computer Science Conference (ITCS) | en_US |
dc.rights | Final published version. This is an open access article. | en_US |
dc.title | Computing Exact Minimum Cuts Without Knowing the Graph | en_US |
dc.type | Conference Article | en_US |
dc.identifier.doi | 10.4230/LIPIcs.ITCS.2018.39 | - |
pu.type.symplectic | http://www.symplectic.co.uk/publications/atom-terms/1.0/conference-proceeding | en_US |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ComputeExactMinCutsWithoutKnowingGraph.pdf | 580.88 kB | Adobe PDF | View/Download |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.