乐胖代购免代理版

{"id":"https://openalex.org/W4281673115","doi":"https://doi.org/10.1145/3519935.3519977","title":"Deterministic, near-linear \ud835\udf00 -approximation algorithm for geometric bipartite matching","display_name":"Deterministic, near-linear \ud835\udf00 -approximation algorithm for geometric bipartite matching","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W4281673115","doi":"https://doi.org/10.1145/3519935.3519977"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3519977","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-article","indexed_in":["crossref"],"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/A5058649592","display_name":"Pankaj K. Agarwal","orcid":"https://orcid.org/0000-0002-9439-181X"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pankaj K. Agarwal","raw_affiliation_strings":["Duke University, USA"],"affiliations":[{"raw_affiliation_string":"Duke University, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003923315","display_name":"Hsien-Chih Chang","orcid":"https://orcid.org/0000-0001-6714-7988"},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hsien-Chih Chang","raw_affiliation_strings":["Dartmouth College, USA"],"affiliations":[{"raw_affiliation_string":"Dartmouth College, USA","institution_ids":["https://openalex.org/I107672454"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034579450","display_name":"Sharath Raghvendra","orcid":null},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sharath Raghvendra","raw_affiliation_strings":["Virginia Tech, USA"],"affiliations":[{"raw_affiliation_string":"Virginia Tech, USA","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087900189","display_name":"Allen Xiao","orcid":"https://orcid.org/0000-0003-3300-7842"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Allen Xiao","raw_affiliation_strings":["Duke University, USA"],"affiliations":[{"raw_affiliation_string":"Duke University, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.95,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.851254,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":70,"max":76},"biblio":{"volume":null,"issue":null,"first_page":"1052","last_page":"1065"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995,"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.9955,"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/tree","display_name":"Tree (set theory)","score":0.5423274},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.52724904},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.44691217}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6794714},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6367723},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5606053},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5448745},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.54371655},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5423274},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.52724904},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5112593},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5100172},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.4605379},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4567304},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.44691217},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.4425537},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43330738},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.41141844},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35630012},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08163792},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3519977","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":21,"referenced_works":["https://openalex.org/W1969357318","https://openalex.org/W1974308542","https://openalex.org/W2009172320","https://openalex.org/W2012833704","https://openalex.org/W2027277859","https://openalex.org/W2057082426","https://openalex.org/W2079168081","https://openalex.org/W2084224084","https://openalex.org/W2091299439","https://openalex.org/W2100654743","https://openalex.org/W2110940003","https://openalex.org/W2125082389","https://openalex.org/W2133352257","https://openalex.org/W2143668817","https://openalex.org/W2157529519","https://openalex.org/W2571257893","https://openalex.org/W2971434485","https://openalex.org/W3037637792","https://openalex.org/W3102176745","https://openalex.org/W4206471589","https://openalex.org/W4229740922"],"related_works":["https://openalex.org/W4295762832","https://openalex.org/W2561454982","https://openalex.org/W2371352078","https://openalex.org/W2352066879","https://openalex.org/W2348257368","https://openalex.org/W2184969544","https://openalex.org/W2080136900","https://openalex.org/W2077309407","https://openalex.org/W2054458431","https://openalex.org/W1592682627"],"abstract_inverted_index":{"Given":[0],"two":[1],"point":[2],"sets":[3],"A":[4,38],"and":[5,19,39,68,92],"B":[6,40],"in":[7,30],"\u211dd":[8],"of":[9,48,86,90],"size":[10],"n":[11],"each,":[12],"for":[13],"some":[14],"constant":[15],"dimension":[16],"d\u2265":[17],"1,":[18],"a":[20,25,34,45,56,60,84,100],"parameter":[21],"\u03b5>0,":[22],"we":[23,93],"present":[24],"deterministic":[26,75],"algorithm":[27,58,77,82],"that":[28],"computes,":[29],"n\u00b7(\u03b5\u22121":[31],"logn)O(d)":[32],"time,":[33],"perfect":[35,108],"matching":[36,51],"between":[37],"whose":[41],"cost":[42],"is":[43,64],"within":[44],"(1+\u03b5)":[46],"factor":[47],"the":[49,73],"optimal":[50],"under":[52],"any":[53],"\u2113p-norm.":[54],"Although":[55],"Monte-Carlo":[57],"with":[59],"similar":[61],"running":[62],"time":[63],"proposed":[65],"by":[66],"Raghvendra":[67],"Agarwal":[69],"[J.":[70],"ACM":[71],"2020],":[72],"best-known":[74],"\u03b5-approximation":[76],"takes":[78],"\u03a9(n3/2)":[79],"time.":[80],"Our":[81],"constructs":[83],"(refinement":[85],"a)":[87],"tree":[88],"cover":[89],"\u211dd,":[91],"develop":[94],"several":[95],"new":[96],"tools":[97],"to":[98,104],"apply":[99],"tree-cover":[101],"based":[102],"approach":[103],"compute":[105],"an":[106],"\u03b5-approximate":[107],"matching.":[109]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4281673115","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2024-12-12T23:34:42.776245","created_date":"2022-06-13"}