乐胖代购免代理版

{"id":"https://openalex.org/W2752747244","doi":"https://doi.org/10.4230/lipics.sea.2017.9","title":"Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders.","display_name":"Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders.","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2752747244","doi":"https://doi.org/10.4230/lipics.sea.2017.9","mag":"2752747244"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/wea/sea2017.html#GeorgiadisIK17","pdf_url":null,"source":{"id":"https://openalex.org/S4306420977","display_name":"Symposium on Experimental and Efficient Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-article","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/A5024478433","display_name":"Loukas Georgiadis","orcid":"https://orcid.org/0000-0002-9706-7409"},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Loukas Georgiadis","raw_affiliation_strings":["University of Ioannina, Ioannina, Greece"],"affiliations":[{"raw_affiliation_string":"University of Ioannina, Ioannina, Greece","institution_ids":["https://openalex.org/I194019607"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086186456","display_name":"Giuseppe F. Italiano","orcid":"https://orcid.org/0000-0002-9492-9894"},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giuseppe F. Italiano","raw_affiliation_strings":["University of Rome Tor Vergata, Rome, Italy"],"affiliations":[{"raw_affiliation_string":"University of Rome Tor Vergata, Rome, Italy","institution_ids":["https://openalex.org/I116067653"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026553420","display_name":"Aikaterini Karanasiou","orcid":null},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Aikaterini Karanasiou","raw_affiliation_strings":["University of Ioannina, Ioannina, Greece"],"affiliations":[{"raw_affiliation_string":"University of Ioannina, Ioannina, Greece","institution_ids":["https://openalex.org/I194019607"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":63},"biblio":{"volume":"75","issue":null,"first_page":"16","last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9959,"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.9959,"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/T11106","display_name":"Data Management and Algorithms","score":0.9926,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9902,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/approximation-algorithms","display_name":"Approximation Algorithms","score":0.555804},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph Algorithms","score":0.542532},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial Optimization","score":0.50694},{"id":"https://openalex.org/keywords/top-k-query-processing","display_name":"Top-k Query Processing","score":0.506278},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.4445683}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7970681},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6057291},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5901339},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.52072906},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5152531},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4662992},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.4445683},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.43015343},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41858596},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39978877},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3812828}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/wea/sea2017.html#GeorgiadisIK17","pdf_url":null,"source":{"id":"https://openalex.org/S4306420977","display_name":"Symposium on Experimental and Efficient Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"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":0,"referenced_works":[],"related_works":["https://openalex.org/W2980567354","https://openalex.org/W2963972775","https://openalex.org/W2963874686","https://openalex.org/W2951019513","https://openalex.org/W2950014258","https://openalex.org/W2945402626","https://openalex.org/W2799145821","https://openalex.org/W2624846542","https://openalex.org/W2584943837","https://openalex.org/W2423358376","https://openalex.org/W2081642962","https://openalex.org/W2031592993","https://openalex.org/W2022122931","https://openalex.org/W1963724232","https://openalex.org/W1811642211","https://openalex.org/W1711138509","https://openalex.org/W1709205181","https://openalex.org/W1539682630","https://openalex.org/W1518653692","https://openalex.org/W114965580"],"abstract_inverted_index":{"Let":[0],"G":[1],"=":[2],"(V,":[3],"E)":[4],"be":[5],"a":[6,41,56,64,75,80,104,114,180],"2-vertex-connected":[7],"directed":[8],"graph":[9],"with":[10],"m":[11],"edges":[12],"and":[13,31,86],"n":[14,96,98],"vertices.":[15],"We":[16,102],"consider":[17],"the":[18,22,91,110,138,146,158,171,177,184],"problem":[19,38],"of":[20,29,44,84,108,116,179],"approximating":[21],"smallest":[23],"2-vertex":[24],"connected":[25],"spanning":[26],"subgraph":[27],"(2VCSS)":[28],"G,":[30],"provide":[32],"new":[33,127,139,162],"efficient":[34],"algorithms":[35,51,112,128],"for":[36],"this":[37,71],"based":[39],"on":[40,113],"clever":[42],"use":[43],"low-high":[45],"orders.":[46],"The":[47,119],"best":[48],"previously":[49,172],"known":[50,173],"were":[52,155],"able":[53],"to":[54],"compute":[55],"3/2-approximation":[57,93,140,148],"in":[58,67,94,131,135,183],"O(m":[59,95],"n+n":[60],"2)":[61],"time,":[62],"or":[63],"3-approximation":[65],"faster":[66,144],"linear":[68],"time.":[69,101,186],"In":[70,133],"paper,":[72],"we":[73],"present":[74],"linear-time":[76,163,174],"algorithm":[77,88,141,164],"that":[78,89,123],"achieves":[79],"better":[81,167],"approximation":[82,153,168],"ratio":[83],"2,":[85],"another":[87],"matches":[90],"previous":[92,147],"+":[97],"2":[99],")":[100],"conducted":[103],"thorough":[105],"experimental":[106,120],"evaluation":[107],"all":[109],"above":[111],"variety":[115],"input":[117],"graphs.":[118],"results":[121],"show":[122],"both":[124],"our":[125,136,161],"two":[126,152],"perform":[129],"well":[130],"practice.":[132],"particular,":[134],"experiments":[137],"was":[142],"always":[143],"than":[145,170],"algorithm,":[149,175],"while":[150],"their":[151],"ratios":[154,169],"close.":[156],"On":[157],"other":[159],"side,":[160],"yielded":[165],"consistently":[166],"at":[176],"price":[178],"small":[181],"overhead":[182],"running":[185]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2752747244","counts_by_year":[],"updated_date":"2024-12-05T16:18:25.974638","created_date":"2017-09-15"}