{"id":"https://openalex.org/W2493827104","doi":"https://doi.org/10.1007/s00453-012-9643-5","title":"Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals","display_name":"Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals","publication_year":2012,"publication_date":"2012-04-10","ids":{"openalex":"https://openalex.org/W2493827104","doi":"https://doi.org/10.1007/s00453-012-9643-5","mag":"2493827104"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-012-9643-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-012-9643-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-012-9643-5.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-012-9643-5.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035530886","display_name":"Markus Bl\u00e4ser","orcid":"https://orcid.org/0000-0002-1750-9036"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus Bl\u00e4ser","raw_affiliation_strings":["Department of Computer Science, Saarland University, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Saarland University, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002315999","display_name":"Bodo Manthey","orcid":"https://orcid.org/0000-0001-6278-5059"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Bodo Manthey","raw_affiliation_strings":["Department of Applied Mathematics, University of Twente, Enschede, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, University of Twente, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110296299","display_name":"B. V. Raghavendra Rao","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"B. V. Raghavendra Rao","raw_affiliation_strings":["Department of Computer Science, Saarland University, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Saarland University, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002315999"],"corresponding_institution_ids":["https://openalex.org/I94624287"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":1.7043,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.85838836,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"66","issue":"2","first_page":"397","last_page":"418"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983999729156494,"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/matching","display_name":"Matching (statistics)","score":0.6530216932296753},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6358323097229004},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6008817553520203},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5995995998382568},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5243195295333862},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.48430195450782776},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.471934050321579},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4608871638774872},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4520712196826935},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39457589387893677},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3886837363243103},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37416183948516846}],"concepts":[{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6530216932296753},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6358323097229004},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6008817553520203},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5995995998382568},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5243195295333862},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.48430195450782776},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.471934050321579},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4608871638774872},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4520712196826935},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39457589387893677},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3886837363243103},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37416183948516846},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00453-012-9643-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-012-9643-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-012-9643-5.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/02a7812b-6245-41e4-a673-9e83bd29197c","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/02a7812b-6245-41e4-a673-9e83bd29197c","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bl\u00e4ser, M, Manthey, B & Rao, B V R 2013, 'Smoothed analysis of partitioning algorithms for Euclidean functionals', Algorithmica, vol. 66, no. 2, pp. 397-418. https://doi.org/10.1007/s00453-012-9643-5","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:ris.utwente.nl:publications/02a7812b-6245-41e4-a673-9e83bd29197c","is_oa":true,"landing_page_url":"http://eprints.eemcs.utwente.nl/secure2/21718/01/Algorithmica_BlaeserEA_SmoothedPartitioning.pdf","pdf_url":"https://ris.utwente.nl/ws/files/6538210/Algorithmica_BlaeserEA_SmoothedPartitioning.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bl\u00e4ser, M, Manthey, B & Rao, B V R 2013, 'Smoothed analysis of partitioning algorithms for Euclidean functionals', Algorithmica, vol. 66, no. 2, pp. 397-418. https://doi.org/10.1007/s00453-012-9643-5","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s00453-012-9643-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-012-9643-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-012-9643-5.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2493827104.pdf","grobid_xml":"https://content.openalex.org/works/W2493827104.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W175627016","https://openalex.org/W1489238841","https://openalex.org/W1547842568","https://openalex.org/W1551519020","https://openalex.org/W1559839959","https://openalex.org/W1571087346","https://openalex.org/W1595409123","https://openalex.org/W1965978641","https://openalex.org/W1977545325","https://openalex.org/W1982562599","https://openalex.org/W1991462609","https://openalex.org/W1993251782","https://openalex.org/W1993966762","https://openalex.org/W1996668544","https://openalex.org/W2005511557","https://openalex.org/W2022563199","https://openalex.org/W2024833542","https://openalex.org/W2026605536","https://openalex.org/W2028163771","https://openalex.org/W2029151602","https://openalex.org/W2034053794","https://openalex.org/W2036457487","https://openalex.org/W2055569927","https://openalex.org/W2055674322","https://openalex.org/W2057795374","https://openalex.org/W2060380213","https://openalex.org/W2070582626","https://openalex.org/W2098712873","https://openalex.org/W2100654743","https://openalex.org/W2109537600","https://openalex.org/W2143037347","https://openalex.org/W2144476828","https://openalex.org/W2145535767","https://openalex.org/W2154714154","https://openalex.org/W2441717076","https://openalex.org/W2479395228","https://openalex.org/W2899702797","https://openalex.org/W3029201735"],"related_works":["https://openalex.org/W1970145791","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W3143937874","https://openalex.org/W4312926500","https://openalex.org/W2067280619","https://openalex.org/W4251343851"],"abstract_inverted_index":{"Euclidean":[0,41,76],"optimization":[1,42],"problems":[2],"such":[3,59],"as":[4],"TSP":[5],"and":[6,54,71,89],"minimum-length":[7,94],"matching":[8],"admit":[9],"fast":[10],"partitioning":[11,38,73,79],"algorithms":[12,39],"that":[13],"compute":[14],"near-optimal":[15],"solutions":[16],"on":[17],"typical":[18],"instances.":[19],"In":[20],"order":[21],"to":[22,37,49,65],"explain":[23],"this":[24],"performance,":[25],"we":[26],"develop":[27],"a":[28,84,90],"general":[29],"framework":[30,45,64],"for":[31,40,75,81,86,92],"the":[32,52,55,82],"application":[33],"of":[34,58,69],"smoothed":[35,67],"analysis":[36],"problems.":[43],"Our":[44],"can":[46],"be":[47],"used":[48],"analyze":[50],"both":[51],"running-time":[53],"approximation":[56],"ratio":[57],"algorithms.":[60],"We":[61],"apply":[62],"our":[63],"obtain":[66],"analyses":[68],"Dyer":[70],"Frieze\u2019s":[72],"algorithm":[74],"matching,":[77],"Karp\u2019s":[78],"scheme":[80],"TSP,":[83],"heuristic":[85,91],"Steiner":[87],"trees,":[88],"degree-bounded":[93],"spanning":[95],"trees.":[96]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}