乐胖代购免代理版

{"id":"https://openalex.org/W2950509221","doi":"https://doi.org/10.1137/1.9781611974782.56","title":"Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion","display_name":"Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2950509221","doi":"https://doi.org/10.1137/1.9781611974782.56","mag":"2950509221"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611974782.56","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611974782.56","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"type":"preprint","type_crossref":"proceedings-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611974782.56","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043851880","display_name":"Eden Chlamt\u00e1\u010d","orcid":"https://orcid.org/0000-0002-0296-0107"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"funder","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Eden Chlamt\u00e1\u010d","raw_affiliation_strings":["Ben Gurion University."],"affiliations":[{"raw_affiliation_string":"Ben Gurion University.","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049161363","display_name":"Michael Dinitz","orcid":"https://orcid.org/0000-0002-2632-966X"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"funder","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michael Dinitz","raw_affiliation_strings":["Ben Gurion University."],"affiliations":[{"raw_affiliation_string":"Ben Gurion University.","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068045392","display_name":"Yury Makarychev","orcid":"https://orcid.org/0000-0003-3114-3947"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"funder","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yury Makarychev","raw_affiliation_strings":["Ben Gurion University."],"affiliations":[{"raw_affiliation_string":"Ben Gurion University.","institution_ids":["https://openalex.org/I124227911"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.999707,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":92},"biblio":{"volume":null,"issue":null,"first_page":"881","last_page":"899"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9999,"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":0.9999,"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.9978,"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/T12288","display_name":"Optimization and Search Problems","score":0.9976,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/hardness-of-approximation","display_name":"Hardness of approximation","score":0.56511146},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.46009606}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7212421},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.66004056},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6477014},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.64719725},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6344252},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.56511146},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.56132543},{"id":"https://openalex.org/C2777894999","wikidata":"https://www.wikidata.org/wiki/Q4781758","display_name":"Approx","level":2,"score":0.5255222},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48506895},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.46009606},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4397443},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21380234},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1702213},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611974782.56","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611974782.56","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},{"is_oa":true,"landing_page_url":"https://arxiv.org/abs/1611.07866","pdf_url":"https://arxiv.org/pdf/1611.07866","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611974782.56","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611974782.56","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":19,"referenced_works":["https://openalex.org/W1501441759","https://openalex.org/W1535144194","https://openalex.org/W1550811836","https://openalex.org/W2017280430","https://openalex.org/W2036836182","https://openalex.org/W2045395359","https://openalex.org/W2082618810","https://openalex.org/W2108967854","https://openalex.org/W2112006606","https://openalex.org/W2143996311","https://openalex.org/W2151679746","https://openalex.org/W2169528477","https://openalex.org/W2179340953","https://openalex.org/W2181409568","https://openalex.org/W2625485910","https://openalex.org/W2952229801","https://openalex.org/W2952587604","https://openalex.org/W2963725737","https://openalex.org/W4297822441"],"related_works":["https://openalex.org/W9203110","https://openalex.org/W2963411648","https://openalex.org/W2757966824","https://openalex.org/W2551034790","https://openalex.org/W2379188955","https://openalex.org/W2096382750","https://openalex.org/W2056597184","https://openalex.org/W2029933769","https://openalex.org/W1712180277","https://openalex.org/W1608414128"],"abstract_inverted_index":{"In":[0],"the":[1,26,43,63,67,77,130,139,155,168,191,214,242,262,280,291,306],"Minimum":[2],"k-Union":[3],"problem":[4,57,72,83,173,310],"(MkU)":[5],"we":[6,75,88,152,221,259,296],"are":[7,16,89],"given":[8],"a":[9,33,93,202,274,301],"set":[10,94],"system":[11],"with":[12],"n":[13],"sets":[14,21,145],"and":[15,135,197,208,284],"asked":[17,90],"to":[18,24,51,91,98,129,132,212,250,253],"select":[19],"k":[20,96,148],"in":[22,86,190],"order":[23],"minimize":[25,99],"size":[27,147],"of":[28,66,95,137,146,157,193,241,277,279],"their":[29,100],"union.":[30],"Despite":[31],"being":[32],"very":[34],"natural":[35,292],"problem,":[36],"it":[37,211,231],"has":[38,103,118,141],"received":[39,120],"surprisingly":[40],"little":[41],"attention:":[42],"only":[44],"known":[45,316],"approximation":[46,138,164,178,304],"algorithm":[47,188,204],"is":[48,165,225,266],"an":[49,176,239,270,285],"due":[50,128],"[Chlamtac":[52],"et":[53],"al":[54],"APPROX'16].":[55],"This":[56],"can":[58],"also":[59,267],"be":[60,233],"viewed":[61],"as":[62,106,109],"bipartite":[64],"version":[65],"Small":[68,78,113],"Set":[69,79,114],"Vertex":[70,81],"Expansion":[71,82,115],"(SSVE),":[73],"which":[74,87,161],"call":[76],"Bipartite":[80],"(SSBVE).":[84],"SSVE,":[85],"find":[92],"nodes":[97],"vertex":[101],"expansion,":[102],"not":[104],"been":[105,143],"well":[107],"studied":[108],"its":[110],"edge-based":[111],"counterpart":[112],"(SSE),":[116],"but":[117],"recently":[119],"significant":[121],"attention,":[122],"e.g.":[123],"[Louis-Makarychev":[124],"APPROX":[125],"'15].":[126],"However,":[127],"connection":[131],"Unique":[133],"Games":[134],"hardness":[136,255],"focus":[140,153],"mostly":[142],"on":[144,154],"=":[149],"\u03a9(n),":[150],"while":[151],"case":[156],"general":[158,308,318],"k,":[159],"for":[160,171,179,181,205,217,248,273,290,305,317],"no":[162,312],"polylogarithmic":[163],"known.We":[166],"improve":[167],"upper":[169],"bound":[170,265],"this":[172,224],"by":[174,200,269],"giving":[175],"\u03b71/4+\u220a":[177],"SSBVE":[180],"any":[182],"constant":[183],"\u220a":[184],">":[185],"0.":[186],"Our":[187],"follows":[189],"footsteps":[192],"Densest":[194],"k-Subgraph":[195],"(DkS)":[196],"related":[198],"problems,":[199],"designing":[201],"tight":[203,226],"random":[206],"models,":[207],"then":[209],"extending":[210],"give":[213],"same":[215,263],"guarantee":[216],"arbitrary":[218],"instances.":[219],"Moreover,":[220],"show":[222,260],"that":[223,261,298],"under":[227],"plausible":[228],"complexity":[229],"conjectures:":[230],"cannot":[232],"approximated":[234],"better":[235],"than":[236],"O(n1/4)":[237],"assuming":[238],"extension":[240],"so-called":[243],"\"Dense":[244],"versus":[245],"Random\"":[246],"conjecture":[247],"DkS":[249],"hypergraphs.In":[251],"addition":[252],"conjectured":[254],"via":[256],"our":[257],"reduction,":[258],"lower":[264],"matched":[268],"integrality":[271,288],"gap":[272,289],"super-constant":[275],"number":[276],"rounds":[278],"Sherali-Adams":[281],"LP":[282],"hierarchy,":[283],"even":[286],"worse":[287],"SDP":[293],"relaxation.":[294],"Finally,":[295],"note":[297],"there":[299],"exists":[300],"simple":[302],"bicriteria":[303],"more":[307],"SSVE":[309],"(where":[311],"non-trivial":[313],"approximations":[314],"were":[315],"k).":[319]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2950509221","counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-04-09T20:58:16.581972","created_date":"2019-06-27"}