[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_267":268},"routes/_layout",{"_11":187},"routes/entity.$type.$id",{"_11":12,"_13":14,"_15":16,"_17":18,"_19":20,"_21":22,"_23":24,"_25":26,"_27":28},"dehydratedState",{"_73":74,"_75":76},"type","paper","id","paper_W2107881198","section","technologies","entity",{"_15":16,"_29":30,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":38,"_39":-5,"_40":41,"_42":43,"_44":45,"_46":47,"_48":-5,"_49":50,"_51":30,"_52":53,"_54":55,"_56":57,"_58":59,"_60":61,"_62":-5,"_63":64,"_65":-5,"_66":67,"_68":30,"_69":-5},"canonical","https://www.hugmap.com/entity/paper/paper_W2107881198/technologies","siteBaseUrl","https://www.hugmap.com","sectionCount",2,"jsonLd","{\"@context\":\"https://schema.org\",\"@graph\":[{\"name\":\"An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm\",\"url\":\"https://www.hugmap.com/entity/paper/paper_W2107881198/technologies\",\"@type\":\"ScholarlyArticle\",\"headline\":\"An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm\",\"datePublished\":\"1998-02-01\",\"isPartOf\":{\"@type\":\"Periodical\",\"name\":\"SIAM Journal on Computing\"}},{\"@type\":\"CollectionPage\",\"name\":\"An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm 相关技术\",\"description\":\"An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm 在 HugMap 中的相关技术，共 2 条，含结构化关联信息与详情链接。\",\"url\":\"https://www.hugmap.com/entity/paper/paper_W2107881198/technologies\",\"inLanguage\":\"zh-CN\"},{\"@type\":\"BreadcrumbList\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"首页\",\"item\":\"https://www.hugmap.com/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"论文\",\"item\":\"https://www.hugmap.com/search?type=paper\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm\",\"item\":\"https://www.hugmap.com/entity/paper/paper_W2107881198\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"相关技术\",\"item\":\"https://www.hugmap.com/entity/paper/paper_W2107881198/technologies\"}]}]}","name","An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm","nameZh","aliases","description","descriptionZh","status","active","externalIds","{\"openalex\":\"W2107881198\",\"doi\":\"10.1137/s0097539794285983\"}","properties","source","openalex","createdAt","2026-05-22T04:04:45.201264974","updatedAt","2026-05-22T04:04:45.201267115","doi","10.1137/s0097539794285983","arxivId","openalexId","W2107881198","title","abstractText","It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This improves upon the previously best-known bound of O(log2k ) and is existentially tight, up to a constant factor. An algorithm for finding a cut with ratio within a factor of O(log k) of the maximum concurrent flow, and thus of the optimal min-cut ratio, is presented.","publishedDate","1998-02-01","publishedYear",1998,"venue","SIAM Journal on Computing","citationCount",264,"authors","keywords",[70,71,72],"pdfUrl","topVenue",false,"displayName","displayDescription","Complexity and Algorithms in Graphs","Optimization and Search Problems","Advanced Graph Theory Research","mutations",[],"queries",[77],{"_78":79,"_80":81,"_82":83,"_84":85},"dehydratedAt",1782145357012,"state",{"_87":88,"_89":90,"_91":79,"_92":-5,"_93":94,"_95":94,"_96":94,"_97":-5,"_98":-5,"_99":67,"_35":100,"_101":102},"queryKey",[86,19,14,16],"queryHash","[\"portal\",\"entity\",\"paper\",\"paper_W2107881198\"]","portal","data",{"_19":20,"_103":104,"_105":106,"_107":108,"_109":110,"_18":111,"_62":112},"dataUpdateCount",1,"dataUpdatedAt","error","errorUpdateCount",0,"errorUpdatedAt","fetchFailureCount","fetchFailureReason","fetchMeta","isInvalidated","success","fetchStatus","idle","entityType","Paper","taxonomies",[155,156,157],"events",[],"articles",[],[135,136],[113,114],{"_15":129,"_29":130,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":131,"_39":-5,"_40":41,"_42":132,"_44":133,"_120":134,"_51":-5,"_121":-5,"_122":-5,"_123":-5,"_60":-5,"_124":-5,"_125":-5,"_126":-5,"_127":-5,"_128":-5,"_68":130,"_69":-5},{"_15":115,"_29":116,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":117,"_39":-5,"_40":41,"_42":118,"_44":119,"_120":-5,"_51":-5,"_121":-5,"_122":-5,"_123":-5,"_60":-5,"_124":-5,"_125":-5,"_126":-5,"_127":-5,"_128":-5,"_68":116,"_69":-5},"person_A5052726191","Yonatan Aumann","{\"openalex\":\"A5052726191\"}","2026-05-22T04:04:45.474506827","2026-05-22T04:04:45.474508788","orcid","affiliation","researchArea","paperCount","homepage","linkedin","twitter","github","hindex","person_A5010842984","Yuval Rabani","{\"openalex\":\"A5010842984\",\"orcid\":\"0000-0001-7772-2544\"}","2026-05-22T02:18:06.178894614","2026-05-23T07:21:11.494116689","0000-0001-7772-2544",{"_15":151,"_29":71,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":152,"_39":-5,"_40":139,"_42":153,"_44":154,"_142":143,"_144":145,"_146":-5,"_147":148,"_149":-5,"_123":-5,"_150":-5,"_68":71,"_69":-5},{"_15":137,"_29":70,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":138,"_39":-5,"_40":139,"_42":140,"_44":141,"_142":143,"_144":145,"_146":-5,"_147":148,"_149":-5,"_123":-5,"_150":-5,"_68":70,"_69":-5},"tech_oa_T10720","{\"taxonomy_id\":\"tax_rd_T10720\"}","openalex_topics","2026-05-17T09:00:32.254345815","2026-05-17T09:00:32.254347962","techType","algorithm","domain","Physical Sciences","proposedYear","maturityLevel","growing","wikipediaUrl","patentCount","tech_oa_T12288","{\"taxonomy_id\":\"tax_rd_T12288\"}","2026-05-17T09:00:26.359658737","2026-05-17T09:00:26.359660246",{"_15":181,"_29":71,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":182,"_39":-5,"_40":41,"_42":183,"_44":184,"_162":163,"_164":-5,"_165":166,"_167":185,"_169":186,"_171":94,"_172":173,"_174":94,"_175":-5,"_68":71,"_69":-5},{"_15":176,"_29":72,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":177,"_39":-5,"_40":41,"_42":178,"_44":179,"_162":163,"_164":-5,"_165":166,"_167":168,"_169":180,"_171":94,"_172":173,"_174":94,"_175":-5,"_68":72,"_69":-5},{"_15":158,"_29":70,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":159,"_39":-5,"_40":41,"_42":160,"_44":161,"_162":163,"_164":-5,"_165":166,"_167":168,"_169":170,"_171":94,"_172":173,"_174":94,"_175":-5,"_68":70,"_69":-5},"tax_rd_T10720","{\"openalex_topic\":\"T10720\"}","2026-05-14T00:53:04.184083304","2026-05-23T12:39:45.27220266","taxonomyType","RESEARCH_DOMAIN","code","level",3,"parentId","tax_rd_1703","path","Physical Sciences/Computer Science/Computational Theory and Mathematics/Complexity and Algorithms in Graphs","sortOrder","isLeaf",true,"entityCount","children","tax_rd_T10374","{\"openalex_topic\":\"T10374\"}","2026-05-14T00:42:06.292994479","2026-05-23T12:24:03.275859385","Physical Sciences/Computer Science/Computational Theory and Mathematics/Advanced Graph Theory Research","tax_rd_T12288","{\"openalex_topic\":\"T12288\"}","2026-05-14T00:41:40.41102011","2026-05-23T12:38:33.232057958","tax_rd_1705","Physical Sciences/Computer Science/Computer Networks and Communications/Optimization and Search Problems",{"_73":188,"_75":189},[],[190],{"_78":191,"_80":192,"_82":193,"_84":194},1782145355847,{"_87":196,"_89":90,"_91":191,"_92":-5,"_93":94,"_95":94,"_96":94,"_97":-5,"_98":-5,"_99":67,"_35":100,"_101":102},[86,195],"[\"portal\",\"industries\"]","industries",[197,198,199,200,201,202,203,204,205,206,207,208],{"_15":260,"_29":261,"_31":-5,"_32":262,"_33":263,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":212,"_42":-5,"_44":-5,"_162":213,"_164":-5,"_165":90,"_167":214,"_169":264,"_171":94,"_172":67,"_174":94,"_175":-5,"_68":261,"_69":263},{"_15":256,"_29":257,"_31":-5,"_32":-5,"_33":258,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":212,"_42":-5,"_44":-5,"_162":213,"_164":-5,"_165":90,"_167":214,"_169":259,"_171":94,"_172":67,"_174":94,"_175":-5,"_68":257,"_69":258},{"_15":250,"_29":251,"_31":-5,"_32":252,"_33":253,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":212,"_42":-5,"_44":-5,"_162":213,"_164":-5,"_165":90,"_167":214,"_169":254,"_171":94,"_172":67,"_174":94,"_175":-5,"_68":251,"_69":253},{"_15":246,"_29":247,"_31":-5,"_32":-5,"_33":248,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":212,"_42":-5,"_44":-5,"_162":213,"_164":-5,"_165":90,"_167":214,"_169":249,"_171":94,"_172":67,"_174":94,"_175":-5,"_68":247,"_69":248},{"_15":242,"_29":243,"_31":-5,"_32":-5,"_33":244,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":212,"_42":-5,"_44":-5,"_162":213,"_164":-5,"_165":90,"_167":214,"_169":245,"_171":94,"_172":67,"_174":94,"_175":-5,"_68":243,"_69":244},{"_15":236,"_29":237,"_31":-5,"_32":238,"_33":239,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":212,"_42":-5,"_44":-5,"_162":213,"_164":-5,"_165":90,"_167":214,"_169":240,"_171":94,"_172":67,"_174":94,"_175":-5,"_68":237,"_69":239},{"_15":232,"_29":233,"_31":-5,"_32":-5,"_33":234,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":212,"_42":-5,"_44":-5,"_162":213,"_164":-5,"_165":90,"_167":214,"_169":235,"_171":94,"_172":173,"_174":94,"_175":-5,"_68":233,"_69":234},{"_15":228,"_29":229,"_31":-5,"_32":-5,"_33":230,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":212,"_42":-5,"_44":-5,"_162":213,"_164":-5,"_165":90,"_167":214,"_169":231,"_171":94,"_172":67,"_174":94,"_175":-5,"_68":229,"_69":230},{"_15":224,"_29":225,"_31":-5,"_32":-5,"_33":226,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":212,"_42":-5,"_44":-5,"_162":213,"_164":-5,"_165":90,"_167":214,"_169":227,"_171":94,"_172":67,"_174":94,"_175":-5,"_68":225,"_69":226},{"_15":220,"_29":221,"_31":-5,"_32":-5,"_33":222,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":212,"_42":-5,"_44":-5,"_162":213,"_164":-5,"_165":90,"_167":214,"_169":223,"_171":94,"_172":67,"_174":94,"_175":-5,"_68":221,"_69":222},{"_15":216,"_29":217,"_31":-5,"_32":-5,"_33":218,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":212,"_42":-5,"_44":-5,"_162":213,"_164":-5,"_165":90,"_167":214,"_169":219,"_171":94,"_172":67,"_174":94,"_175":-5,"_68":217,"_69":218},{"_15":209,"_29":210,"_31":-5,"_32":-5,"_33":211,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":212,"_42":-5,"_44":-5,"_162":213,"_164":-5,"_165":90,"_167":214,"_169":215,"_171":94,"_172":67,"_174":94,"_175":-5,"_68":210,"_69":211},"tax_ind_smartphone","智能手机","Smartphone","manual","INDUSTRY","tax_ind_root","科技行业/智能手机","tax_ind_robot","机器人","Robotics","科技行业/机器人","tax_ind_wearable","智能穿戴","Smart Wearables","科技行业/智能穿戴","tax_ind_energy","新能源与智能制造","New Energy & Smart Manufacturing","科技行业/新能源与智能制造","tax_ind_biotech","生物科技","Biotech","科技行业/生物科技","tax_ind_quantum","量子计算","Quantum Computing","科技行业/量子计算","tax_ind_blockchain","区块链",[241],"Blockchain","科技行业/区块链","Web3","tax_ind_enterprise","企业软件","Enterprise Software","科技行业/企业软件","tax_ind_security","网络安全","Cybersecurity","科技行业/网络安全","tax_ind_semi","半导体",[255],"Semiconductor","科技行业/半导体","芯片","tax_ind_cloud","云计算","Cloud Computing","科技行业/云计算","tax_ind_ai","人工智能",[265,266],"Artificial Intelligence","科技行业/人工智能","AI","AI 技术","env",{"_269":24},"SITE_BASE_URL"]

An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm 论文

An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm · 相关技术

相关技术