{"id":"https://openalex.org/W3006290891","doi":"https://doi.org/10.1007/s00453-022-00951-x","title":"Approximating Multistage Matching Problems","display_name":"Approximating Multistage Matching Problems","publication_year":2022,"publication_date":"2022-03-23","ids":{"openalex":"https://openalex.org/W3006290891","doi":"https://doi.org/10.1007/s00453-022-00951-x","mag":"3006290891"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-022-00951-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-00951-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-00951-x.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-022-00951-x.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044475263","display_name":"Markus Chimani","orcid":"https://orcid.org/0000-0002-4681-5550"},"institutions":[{"id":"https://openalex.org/I170658231","display_name":"Osnabr\u00fcck University","ror":"https://ror.org/04qmmjx98","country_code":"DE","type":"education","lineage":["https://openalex.org/I170658231"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus Chimani","raw_affiliation_strings":["Theoretical Computer Science, Osnabr\u00fcck University, Osnabr\u00fcck, Germany"],"raw_orcid":"https://orcid.org/0000-0002-4681-5550","affiliations":[{"raw_affiliation_string":"Theoretical Computer Science, Osnabr\u00fcck University, Osnabr\u00fcck, Germany","institution_ids":["https://openalex.org/I170658231"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088766650","display_name":"Niklas Troost","orcid":"https://orcid.org/0000-0001-7412-2770"},"institutions":[{"id":"https://openalex.org/I170658231","display_name":"Osnabr\u00fcck University","ror":"https://ror.org/04qmmjx98","country_code":"DE","type":"education","lineage":["https://openalex.org/I170658231"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Niklas Troost","raw_affiliation_strings":["Theoretical Computer Science, Osnabr\u00fcck University, Osnabr\u00fcck, Germany"],"raw_orcid":"https://orcid.org/0000-0001-7412-2770","affiliations":[{"raw_affiliation_string":"Theoretical Computer Science, Osnabr\u00fcck University, Osnabr\u00fcck, Germany","institution_ids":["https://openalex.org/I170658231"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055002184","display_name":"Tilo Wiedera","orcid":"https://orcid.org/0000-0002-5923-4114"},"institutions":[{"id":"https://openalex.org/I170658231","display_name":"Osnabr\u00fcck University","ror":"https://ror.org/04qmmjx98","country_code":"DE","type":"education","lineage":["https://openalex.org/I170658231"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tilo Wiedera","raw_affiliation_strings":["Theoretical Computer Science, Osnabr\u00fcck University, Osnabr\u00fcck, Germany"],"raw_orcid":"https://orcid.org/0000-0002-5923-4114","affiliations":[{"raw_affiliation_string":"Theoretical Computer Science, Osnabr\u00fcck University, Osnabr\u00fcck, Germany","institution_ids":["https://openalex.org/I170658231"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5088766650"],"corresponding_institution_ids":["https://openalex.org/I170658231"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":0.5664,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.64109499,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"84","issue":"8","first_page":"2135","last_page":"2153"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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.9987000226974487,"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/vertex","display_name":"Vertex (graph theory)","score":0.6180931329727173},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6146108508110046},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.612438440322876},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5817962288856506},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.563213050365448},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4949278235435486},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4602453112602234},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43774253129959106},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43697959184646606},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36857903003692627},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3398359715938568},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3221699893474579}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6180931329727173},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6146108508110046},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.612438440322876},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5817962288856506},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.563213050365448},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4949278235435486},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4602453112602234},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43774253129959106},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43697959184646606},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36857903003692627},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3398359715938568},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3221699893474579},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-022-00951-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-00951-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-00951-x.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"}],"best_oa_location":{"id":"doi:10.1007/s00453-022-00951-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-00951-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-00951-x.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/F4320329560","display_name":"Universit\u00e4t Osnabr\u00fcck","ror":"https://ror.org/04qmmjx98"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3006290891.pdf","grobid_xml":"https://content.openalex.org/works/W3006290891.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W355401516","https://openalex.org/W853930207","https://openalex.org/W1594302759","https://openalex.org/W1687550682","https://openalex.org/W2010151376","https://openalex.org/W2011039300","https://openalex.org/W2031592993","https://openalex.org/W2038728802","https://openalex.org/W2051294918","https://openalex.org/W2086991377","https://openalex.org/W2089939118","https://openalex.org/W2343286580","https://openalex.org/W2476096155","https://openalex.org/W2809141942","https://openalex.org/W2912134658","https://openalex.org/W2963993884","https://openalex.org/W2974037670","https://openalex.org/W2978070678","https://openalex.org/W2996596490","https://openalex.org/W2996918322","https://openalex.org/W2998856043","https://openalex.org/W3005014916","https://openalex.org/W3153719637","https://openalex.org/W3165521905","https://openalex.org/W3183892126","https://openalex.org/W3184162842","https://openalex.org/W4205839541","https://openalex.org/W4234281607","https://openalex.org/W4298234727"],"related_works":["https://openalex.org/W1972035260","https://openalex.org/W4250775169","https://openalex.org/W2794488505","https://openalex.org/W4301594054","https://openalex.org/W4309231192","https://openalex.org/W3125889879","https://openalex.org/W2064563243","https://openalex.org/W3124422538","https://openalex.org/W2032550399","https://openalex.org/W2057791178"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"multistage":[2,112],"perfect":[3,26],"matching":[4],"problems,":[5],"we":[6,45,74,88,105],"are":[7,19,38,63],"given":[8],"a":[9,23,90],"sequence":[10,24,31],"of":[11,25,32,96],"graphs":[12],"on":[13,93,117],"the":[14,30,49,53,76,85,102],"same":[15],"vertex":[16],"set":[17],"and":[18],"asked":[20],"to":[21,29,47,110],"find":[22],"matchings,":[27],"corresponding":[28],"graphs,":[33],"such":[34],"that":[35,60],"consecutive":[36,56],"matchings":[37],"as":[39,41],"similar":[40],"possible.":[42],"More":[43],"precisely,":[44],"aim":[46],"maximize":[48],"intersections,":[50],"or":[51],"minimize":[52],"unions":[54],"between":[55],"matchings.":[57],"We":[58],"show":[59],"these":[61,82],"problems":[62],"NP-hard":[64],"even":[65],"in":[66],"very":[67],"restricted":[68],"scenarios.":[69],"As":[70],"our":[71],"main":[72],"contribution,":[73],"present":[75],"first":[77],"non-trivial":[78],"approximation":[79,92],"algorithms":[80],"for":[81],"problems:":[83],"On":[84,101],"one":[86],"hand,":[87,104],"devise":[89],"tight":[91],"graph":[94],"sequences":[95],"length":[97],"two":[98],"(2-stage":[99],"graphs).":[100],"other":[103],"propose":[106],"several":[107],"general":[108],"methods":[109],"deduce":[111],"approximations":[113,116],"from":[114],"blackbox":[115],"2-stage":[118],"graphs.":[119]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}