{"id":"https://openalex.org/W4401395806","doi":"https://doi.org/10.1007/s10878-024-01200-3","title":"On the complexity of minimum maximal acyclic matchings","display_name":"On the complexity of minimum maximal acyclic matchings","publication_year":2024,"publication_date":"2024-08-01","ids":{"openalex":"https://openalex.org/W4401395806","doi":"https://doi.org/10.1007/s10878-024-01200-3"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-024-01200-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-024-01200-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-024-01200-3.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","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/s10878-024-01200-3.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039045414","display_name":"Juhi Chaudhary","orcid":"https://orcid.org/0000-0001-5560-9129"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Juhi Chaudhary","raw_affiliation_strings":["School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, India"],"raw_orcid":"https://orcid.org/0000-0001-5560-9129","affiliations":[{"raw_affiliation_string":"School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, India","institution_ids":["https://openalex.org/I11947397"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101610160","display_name":"Sounaka Mishra","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sounaka Mishra","raw_affiliation_strings":["Department of Mathematics, Indian Institute of Technology Madras, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Indian Institute of Technology Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061095539","display_name":"B. S. Panda","orcid":"https://orcid.org/0000-0002-0721-5325"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"B. S. Panda","raw_affiliation_strings":["Department of Mathematics, Indian Institute of Technology Delhi, New Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Indian Institute of Technology Delhi, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5039045414"],"corresponding_institution_ids":["https://openalex.org/I11947397"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":1.3828,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.83013826,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"48","issue":"1","first_page":null,"last_page":null},"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.9993000030517578,"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.9993000030517578,"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.9988999962806702,"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/T12288","display_name":"Optimization and Search Problems","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7291735410690308},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5983121991157532},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5357721447944641},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43877464532852173},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3794713616371155},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3500175178050995},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.16396784782409668}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7291735410690308},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5983121991157532},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5357721447944641},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43877464532852173},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3794713616371155},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3500175178050995},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.16396784782409668}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-024-01200-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-024-01200-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-024-01200-3.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:48:y:2024:i:1:d:10.1007_s10878-024-01200-3","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-024-01200-3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"}],"best_oa_location":{"id":"doi:10.1007/s10878-024-01200-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-024-01200-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-024-01200-3.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6800000071525574,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320715","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4401395806.pdf"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W1968988491","https://openalex.org/W1985482016","https://openalex.org/W1988133548","https://openalex.org/W2002427023","https://openalex.org/W2003979824","https://openalex.org/W2011039300","https://openalex.org/W2012931553","https://openalex.org/W2033371793","https://openalex.org/W2038225707","https://openalex.org/W2041965963","https://openalex.org/W2044089009","https://openalex.org/W2057208373","https://openalex.org/W2068155033","https://openalex.org/W2077326803","https://openalex.org/W2079887842","https://openalex.org/W2137560895","https://openalex.org/W2483664717","https://openalex.org/W2625060274","https://openalex.org/W2748469983","https://openalex.org/W2966046296","https://openalex.org/W3110710068","https://openalex.org/W4210377846","https://openalex.org/W4233756358","https://openalex.org/W4311085763","https://openalex.org/W4312434266","https://openalex.org/W4312681191","https://openalex.org/W4313351182","https://openalex.org/W4318023078","https://openalex.org/W4324387296","https://openalex.org/W4386974175","https://openalex.org/W4386974189"],"related_works":["https://openalex.org/W2567825307","https://openalex.org/W1592682627","https://openalex.org/W4295762832","https://openalex.org/W2945016732","https://openalex.org/W2785998768","https://openalex.org/W2371352078","https://openalex.org/W4390409907","https://openalex.org/W3085245180","https://openalex.org/W2586280130","https://openalex.org/W4221143622"],"abstract_inverted_index":{"Abstract":[0],"Low-Acy-Matching":[1,36,61,89,101,149],"asks":[2],"to":[3,39,159],"find":[4],"a":[5,10,106],"maximal":[6],"matching":[7],"M":[8,22],"in":[9,29],"given":[11],"graph":[12],"G":[13,30],"of":[14,21,35,60,108],"minimum":[15],"cardinality":[16],"such":[17],"that":[18,56,148],"the":[19,57,85],"set":[20],"-saturated":[23],"vertices":[24],"induces":[25],"an":[26],"acyclic":[27],"subgraph":[28],".":[31,92,144],"The":[32],"decision":[33,58],"version":[34,59],"is":[37],"known":[38],"be":[40,103],"$${\\textsf{NP}}$$":[41,63],"<mml:math":[42,64,111,126,136,152],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[43,65,112,127,137,153],"<mml:mi>NP</mml:mi>":[44,66,141],"</mml:math>":[45,67,121,133,143,155],"-complete.":[46],"In":[47],"this":[48,52],"paper,":[49],"we":[50,94,146],"strengthen":[51],"result":[53],"by":[54],"proving":[55],"remains":[62],"-complete":[68],"for":[69,98,122],"bipartite":[70,80,99],"graphs":[71],"with":[72],"maximum":[73],"degree":[74],"6":[75],"and":[76,90],"planar":[77],"perfect":[78],"elimination":[79],"graphs.":[81,161],"We":[82],"also":[83],"show":[84],"hardness":[86],"difference":[87],"between":[88],"Max-Acy-Matching":[91],"Furthermore,":[93],"prove":[95],"that,":[96],"even":[97],"graphs,":[100],"cannot":[102],"approximated":[104],"within":[105],"ratio":[107],"$$n^{1-\\epsilon":[109],"}$$":[110],"<mml:msup>":[113],"<mml:mi>n</mml:mi>":[114],"<mml:mrow>":[115,128,138],"<mml:mn>1</mml:mn>":[116],"<mml:mo>-</mml:mo>":[117],"<mml:mi>\u03f5</mml:mi>":[118,129],"</mml:mrow>":[119,132,142],"</mml:msup>":[120],"any":[123],"$$\\epsilon":[124],"&gt;0$$":[125],"<mml:mo>&gt;</mml:mo>":[130],"<mml:mn>0</mml:mn>":[131],"unless":[134],"$${\\textsf{P}}={\\textsf{NP}}$$":[135],"<mml:mi>P</mml:mi>":[139],"<mml:mo>=</mml:mo>":[140],"Finally,":[145],"establish":[147],"exhibits":[150],"$$\\textsf{APX}$$":[151],"<mml:mi>APX</mml:mi>":[154],"-hardness":[156],"when":[157],"restricted":[158],"4-regular":[160]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}