{"id":"https://openalex.org/W2160532428","doi":"https://doi.org/10.1007/s00446-013-0194-z","title":"No sublogarithmic-time approximation scheme for bipartite vertex cover","display_name":"No sublogarithmic-time approximation scheme for bipartite vertex cover","publication_year":2013,"publication_date":"2013-09-16","ids":{"openalex":"https://openalex.org/W2160532428","doi":"https://doi.org/10.1007/s00446-013-0194-z","mag":"2160532428"},"language":"en","primary_location":{"id":"doi:10.1007/s00446-013-0194-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00446-013-0194-z","pdf_url":null,"source":{"id":"https://openalex.org/S139349430","display_name":"Distributed Computing","issn_l":"0178-2770","issn":["0178-2770","1432-0452"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Distributed Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1205.4605","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Mika G\u00f6\u00f6s","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Mika G\u00f6\u00f6s","raw_affiliation_strings":["Department of Computer Science, University of Toronto, 3302-10 King\u2019s College Road, Toronto, ON\u00a0, M5S 3G4, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, 3302-10 King\u2019s College Road, Toronto, ON\u00a0, M5S 3G4, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":null,"display_name":"Jukka Suomela","orcid":null},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]},{"id":"https://openalex.org/I32943570","display_name":"Helsinki Institute for Information Technology","ror":"https://ror.org/05kph4940","country_code":"FI","type":"facility","lineage":["https://openalex.org/I133731052","https://openalex.org/I32943570","https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Jukka Suomela","raw_affiliation_strings":["Helsinki Institute for Information Technology HIIT, Department of Computer Science, P.O. Box 68, 00014\u00a0, University of Helsinki, Finland"],"affiliations":[{"raw_affiliation_string":"Helsinki Institute for Information Technology HIIT, Department of Computer Science, P.O. Box 68, 00014\u00a0, University of Helsinki, Finland","institution_ids":["https://openalex.org/I32943570","https://openalex.org/I133731052"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":{"value":2490,"currency":"EUR","value_usd":3090},"apc_paid":null,"fwci":0.3736,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.68071886,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"27","issue":"6","first_page":"435","last_page":"443"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7287999987602234,"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.7287999987602234,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.06369999796152115,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.05429999902844429,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/bipartite-graph","display_name":"Bipartite graph","score":0.7595999836921692},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7394000291824341},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5444999933242798},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5169000029563904},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.515999972820282},{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.4668999910354614},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4226999878883362},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.42089998722076416},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4205999970436096},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.38940000534057617}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7918999791145325},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7595999836921692},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7394000291824341},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7135000228881836},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5444999933242798},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5169000029563904},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.515999972820282},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.4668999910354614},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.444599986076355},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4226999878883362},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.42089998722076416},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4205999970436096},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.38940000534057617},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.38019999861717224},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.34130001068115234},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3402999937534332},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.33649998903274536},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.3149000108242035},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.29339998960494995},{"id":"https://openalex.org/C86941820","wikidata":"https://www.wikidata.org/wiki/Q6865391","display_name":"Minimisation (clinical trials)","level":2,"score":0.29330000281333923},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.275299996137619},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.27300000190734863},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2687999904155731},{"id":"https://openalex.org/C32972407","wikidata":"https://www.wikidata.org/wiki/Q1187620","display_name":"Perfect graph","level":5,"score":0.2662000060081482},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.2646999955177307},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2612000107765198},{"id":"https://openalex.org/C2993105083","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Simple graph","level":3,"score":0.25940001010894775},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25920000672340393},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.2542000114917755},{"id":"https://openalex.org/C2779182943","wikidata":"https://www.wikidata.org/wiki/Q25345219","display_name":"Decomposition theorem","level":2,"score":0.2513999938964844},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.25}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00446-013-0194-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00446-013-0194-z","pdf_url":null,"source":{"id":"https://openalex.org/S139349430","display_name":"Distributed Computing","issn_l":"0178-2770","issn":["0178-2770","1432-0452"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Distributed Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1205.4605","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1205.4605","pdf_url":"https://arxiv.org/pdf/1205.4605","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":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":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1205.4605","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1205.4605","pdf_url":"https://arxiv.org/pdf/1205.4605","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":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":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1502920553","https://openalex.org/W1869515244","https://openalex.org/W1925030049","https://openalex.org/W1980155175","https://openalex.org/W1998544343","https://openalex.org/W2017345786","https://openalex.org/W2018047324","https://openalex.org/W2036871172","https://openalex.org/W2054910423","https://openalex.org/W2109330224","https://openalex.org/W2135290452","https://openalex.org/W2138623498","https://openalex.org/W2153822379","https://openalex.org/W2165441947","https://openalex.org/W3083245826","https://openalex.org/W4205300528","https://openalex.org/W4248332043"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}