{"id":"https://openalex.org/W2079266301","doi":"https://doi.org/10.1137/100808800","title":"Robust Matchings and Matroid Intersections","display_name":"Robust Matchings and Matroid Intersections","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2079266301","doi":"https://doi.org/10.1137/100808800","mag":"2079266301"},"language":"en","primary_location":{"id":"doi:10.1137/100808800","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100808800","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"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/A5084105348","display_name":"Ryo Fujita","orcid":"https://orcid.org/0000-0003-4905-2402"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ryo Fujita","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074548000","display_name":"Yusuke Kobayashi","orcid":"https://orcid.org/0000-0001-9478-7307"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yusuke Kobayashi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5110768204","display_name":"Kazuhisa Makino","orcid":"https://orcid.org/0009-0000-9771-4955"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kazuhisa Makino","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4582,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.82836991,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"27","issue":"3","first_page":"1234","last_page":"1256"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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.9984999895095825,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.9222513437271118},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8206076622009277},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8002513647079468},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5358226299285889},{"id":"https://openalex.org/keywords/independence-number","display_name":"Independence number","score":0.5305267572402954},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5272570848464966},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5016908645629883},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.49686601758003235},{"id":"https://openalex.org/keywords/matroid-partitioning","display_name":"Matroid partitioning","score":0.45716631412506104},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4161060154438019},{"id":"https://openalex.org/keywords/graphic-matroid","display_name":"Graphic matroid","score":0.20865139365196228}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9222513437271118},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8206076622009277},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8002513647079468},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5358226299285889},{"id":"https://openalex.org/C2984853995","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independence number","level":3,"score":0.5305267572402954},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5272570848464966},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5016908645629883},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.49686601758003235},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.45716631412506104},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4161060154438019},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.20865139365196228},{"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.1137/100808800","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100808800","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1789148113","display_name":"Basic studies on discrete enumeration algorithms","funder_award_id":"22500007","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G3159705473","display_name":"Exploring the limits of computation from mathematical logic","funder_award_id":"24106002","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G3163659628","display_name":"Unified Optimization Theory by Discrete Convex Paradigm","funder_award_id":"21360045","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G8326857615","display_name":"Using dual concepts in graph minor algorithms","funder_award_id":"24700004","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W2029846150","https://openalex.org/W2095381673","https://openalex.org/W2913331726"],"related_works":["https://openalex.org/W2625145881","https://openalex.org/W2159059797","https://openalex.org/W2058489697","https://openalex.org/W2400862597","https://openalex.org/W1984819493","https://openalex.org/W4246417054","https://openalex.org/W2072414647","https://openalex.org/W4367050287","https://openalex.org/W2106233458","https://openalex.org/W1975978423"],"abstract_inverted_index":{"In":[0,100],"a":[1,34,38,55,59,63,84,93,119,141,166,200,223,247,257],"weighted":[2,56,64,168,248],"independence":[3,65],"system,":[4,66],"an":[5,42,171],"independent":[6,43],"set":[7,40,44,51],"is":[8,25,41,58,124,174,217,222],"said":[9],"to":[10,110,163],"be":[11,90,108,145],"$\\alpha$-robust":[12,172],"if,":[13],"for":[14,154,182,203,206,238,242,259],"all":[15],"$p$,":[16],"the":[17,30,111,130,134,161,179,204,207,215,226,231,234,261],"total":[18],"weight":[19,32],"of":[20,33,52,62,133,225,233],"its":[21],"heaviest":[22],"$p$":[23,48],"elements":[24],"at":[26,46],"least":[27],"$\\alpha$":[28,158,221],"times":[29],"maximum":[31],"$p$-independent":[35,39],"set.":[36],"Here":[37],"with":[45,159,178],"most":[47,262],"elements.":[49],"The":[50],"matchings":[53],"in":[54,97,147,184],"graph":[57,82,169,249],"typical":[60],"example":[61],"and":[67,69,87,187],"Hassin":[68,186],"Rubinstein":[70],"[SIAM":[71],"J.":[72,191],"Discrete":[73,192],"Math.,":[74,193],"15":[75,194],"(2002),":[76,195],"pp.":[77,196],"530--537]":[78,197],"showed":[79],"that":[80,105,140,214,251],"every":[81],"has":[83,170],"$\\frac{1}{\\sqrt2}$-robust":[85,120],"matching":[86,136,143,173,209],"it":[88,106],"can":[89,107,144],"found":[91],"by":[92],"$k$th":[94,235,253],"power":[95,236,254],"algorithm":[96,237,255],"polynomial":[98,148],"time.":[99],"this":[101],"paper,":[102],"we":[103,212,229],"show":[104,139,213,230],"extended":[109],"matroid":[112,121],"intersection":[113],"problem;":[114],"i.e.,":[115,241],"there":[116,245],"always":[117],"exists":[118,246],"intersection,":[122],"which":[123],"polynomially":[125],"computable.":[126],"We":[127,138],"also":[128],"study":[129],"time":[131,149],"complexity":[132,205],"robust":[135,208,239,263],"problem.":[137,210],"1-robust":[142],"computed":[146],"(if":[150],"one":[151],"exists),":[152],"and,":[153],"any":[155,243],"fixed":[156],"number":[157],"$\\frac{1}{\\sqrt2}<\\alpha<1$,":[160],"problem":[162,216],"determine":[164],"whether":[165],"given":[167],"NP-complete.":[175],"These":[176],"together":[177],"positive":[180],"result":[181],"$\\alpha=\\frac{1}{\\sqrt2}$":[183],"[R.":[185],"S.":[188],"Rubinstein,":[189],"SIAM":[190],"give":[198],"us":[199],"sharp":[201],"border":[202],"Moreover,":[211],"strongly":[218],"NP-complete":[219],"when":[220],"part":[224],"input.":[227],"Finally,":[228],"limitations":[232],"matchings;":[240],"$\\epsilon>0$,":[244],"such":[250],"no":[252],"outputs":[256],"$(\\frac{1}{\\sqrt2}+\\epsilon)$-approximation":[258],"computing":[260],"matching.":[264]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-09T07:52:08.696243","created_date":"2025-10-10T00:00:00"}