{"id":"https://openalex.org/W1496921672","doi":null,"title":"Random sampling in graph optimization problems","display_name":"Random sampling in graph optimization problems","publication_year":1995,"publication_date":"1995-02-01","ids":{"openalex":"https://openalex.org/W1496921672","mag":"1496921672"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.167.658","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.167.658","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/karger/Papers/thesis.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028448267","display_name":"David Ron Karger","orcid":"https://orcid.org/0000-0002-0024-5847","observed_orcids":["https://orcid.org/0000-0002-0024-5847"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"David R. Karger","raw_affiliation_strings":["Stanford University Stanford CA"],"raw_orcid":"https://orcid.org/0000-0002-0024-5847","affiliations":[{"raw_affiliation_string":"Stanford University Stanford CA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028448267"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":7.0204,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.9772801,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/random-sampling","display_name":"random sampling","score":0.9269999861717224},{"id":"https://openalex.org/keywords/representative-samples","display_name":"representative samples","score":0.6320000290870667},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8330000042915344},{"id":"https://openalex.org/keywords/undirected-graphs","display_name":"undirected graphs","score":0.7860000133514404},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.8619999885559082},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"minimum spanning tree","score":0.9179999828338623},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"minimum cut","score":0.9570000171661377},{"id":"https://openalex.org/keywords/multiway-cut","display_name":"multiway cut","score":0.8309999704360962},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.7160000205039978},{"id":"https://openalex.org/keywords/derandomization","display_name":"derandomization","score":0.9290000200271606},{"id":"https://openalex.org/keywords/all-terminal-reliability","display_name":"all-terminal reliability","score":0.746999979019165},{"id":"https://openalex.org/keywords/network-reliability","display_name":"network reliability","score":0.5339999794960022},{"id":"https://openalex.org/keywords/maximum-flow","display_name":"maximum flow","score":0.9710000157356262},{"id":"https://openalex.org/keywords/network-design","display_name":"network design","score":0.6169999837875366},{"id":"https://openalex.org/keywords/connectivity-requirements","display_name":"connectivity requirements","score":0.5899999737739563},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"graph coloring","score":0.6290000081062317},{"id":"https://openalex.org/keywords/3-colorable-graphs","display_name":"3-colorable graphs","score":0.9330000281333923},{"id":"https://openalex.org/keywords/matroids","display_name":"matroid theory","score":0.7649999856948853},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.7889999747276306}],"concepts":[{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.6733928322792053},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6369900107383728},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5680776834487915},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5666239857673645},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.46519386768341064},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.45731019973754883},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4244455397129059},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3772222697734833},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36152368783950806},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34466224908828735}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.167.658","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.167.658","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/karger/Papers/thesis.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.187.2992","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.2992","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/karger/Papers/thesis.pdf","raw_type":"text"},{"id":"mag:1496921672","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=220773","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7095196870","https://openalex.org/W2150516767","https://openalex.org/W7100250081","https://openalex.org/W7099696339","https://openalex.org/W3143927905","https://openalex.org/W2952550543","https://openalex.org/W2047976119","https://openalex.org/W7097478014","https://openalex.org/W2051540665","https://openalex.org/W1971680255"],"abstract_inverted_index":{"The":[0,111],"representative":[1,57,70],"random":[2,69,205,302],"sample":[3,29,58],"is":[4,11,65,99],"a":[5,16,22,27,56,175,202],"central":[6],"concept":[7,54],"of":[8,19,55,77,106,158,198,201,242,253,301],"statistics.":[9],"It":[10],"often":[12],"possible":[13],"to":[14,59,66,90,133,267,289],"gather":[15],"great":[17],"deal":[18],"information":[20],"about":[21],"large":[23],"population":[24],"by":[25],"examining":[26],"small":[28,68],"randomly":[30],"drawn":[31],"from":[32,287],"it.":[33],"This":[34],"approach":[35],"has":[36],"obvious":[37],"advantages":[38],"in":[39,45,48,75,185,281,304],"reducing":[40],"the":[41,50,53,78,142,159,164,193,238,254,282],"investigator's":[42],"work,":[43],"both":[44],"gathering":[46],"and":[47,72,151,212,227,233,291],"analyzing":[49],"data.\r\nWe":[51],"apply":[52],"combinatorial":[60],"optimization.":[61],"Our":[62,97],"general":[63],"technique":[64],"generate":[67],"subproblems":[71],"solve":[73],"them":[74],"lieu":[76],"original":[79],"ones,":[80],"producing":[81],"approximately":[82,148,219],"correct":[83,91],"answers":[84],"which":[85],"may":[86],"then":[87],"be":[88,182],"refined":[89],"ones":[92],"at":[93],"little":[94],"additional":[95],"cost.":[96],"focus":[98],"optimization":[100],"problems":[101],"on":[102,192],"undirected":[103],"graphs.":[104],"Highlights":[105],"our":[107],"results":[108],"include:":[109],"(1)":[110],"first":[112,143,165],"(randomized)":[113,122],"linear":[114,213],"time":[115,128,137,210,284],"minimum":[116,123,160,171,179,220,231,244,255],"spanning":[117,256],"tree":[118,257],"algorithm;":[119],"(2)":[120],"A":[121],"cut":[124,161],"algorithm":[125,144,169],"with":[126,174],"running":[127],"roughly":[129,135],"$O(n\\sp2)$":[130],"as":[131,139,141],"compared":[132],"previous":[134],"$O(n\\sp3)$":[136],"bounds,":[138],"well":[140],"for":[145,170,217,225,271,295],"finding":[146,218,229],"all":[147,194],"minimal":[149],"cuts":[150,180,232],"multiway":[152],"cuts;":[153,221],"(3)":[154],"An":[155,299],"efficient":[156],"parallelization":[157],"algorithm,":[162],"providing":[163],"parallel":[166,186,215],"$({\\cal":[167,187],"RNC})$":[168],"cuts,":[172],"together":[173],"derandomization":[176],"proving":[177],"that":[178],"can":[181],"found":[183],"deterministically":[184],"NC})$;":[188],"(4)":[189],"Tight":[190],"bounds":[191,263,286,294],"terminal":[195],"reliability":[196],"(probability":[197],"remaining":[199],"connected)":[200],"network":[203],"suffering":[204],"edge":[206],"failures.":[207],"(5)":[208],"Linear":[209],"sequential":[211],"processor":[214],"algorithms":[216,224],"(6)":[222],"Faster":[223],"approximating":[226],"exactly":[228],"s-t":[230],"maximum":[234],"flows;":[235],"(7)":[236],"For":[237,276],"${\\cal":[239],"NP}$-complete":[240],"problem":[241],"designing":[243],"cost":[245],"networks":[246],"satisfying":[247],"specified":[248],"connectivity":[249],"requirements":[250],"(a":[251],"generalization":[252],"problem),":[258],"significantly":[259],"improved":[260],"polynomial-time":[261],"approximation":[262,285],"(from":[264],"$O(\\log":[265],"n)$":[266],"1":[268],"+":[269],"o(1)":[270],"many":[272],"such":[273],"problems);":[274],"(8)":[275],"coloring":[277],"3-colorable":[278],"graphs,":[279],"improvements":[280],"polynomial":[283],"O($n\\sp{3/8})$":[288],"O($n\\sp{1/4}),$":[290],"even":[292],"better":[293],"sparse":[296],"graphs;":[297],"(9)":[298],"analysis":[300],"sampling":[303],"matroids.":[305]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}