{"id":"https://openalex.org/W7163897633","doi":"https://doi.org/10.4230/lipics.swat.2026.39","title":"Faster Approximate Linear Matroid Intersection","display_name":"Faster Approximate Linear Matroid Intersection","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163897633","doi":"https://doi.org/10.4230/lipics.swat.2026.39"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26075","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.39","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.39/LIPIcs.SWAT.2026.39.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.39/LIPIcs.SWAT.2026.39.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015314222","display_name":"Tatsuya Terao","orcid":"https://orcid.org/0000-0002-3530-2194"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Terao, Tatsuya","raw_affiliation_strings":["Research Institute for Mathematical Sciences, Kyoto University, Japan"],"raw_orcid":"https://orcid.org/0000-0002-3530-2194","affiliations":[{"raw_affiliation_string":"Research Institute for Mathematical Sciences, Kyoto University, Japan","institution_ids":["https://openalex.org/I22299242"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5015314222"],"corresponding_institution_ids":["https://openalex.org/I22299242"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.9436345,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"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.8598999977111816,"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.8598999977111816,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.0502999983727932,"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"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.021900000050663948,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.8745999932289124},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.6312999725341797},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5760999917984009},{"id":"https://openalex.org/keywords/weighted-matroid","display_name":"Weighted matroid","score":0.560699999332428},{"id":"https://openalex.org/keywords/matroid-partitioning","display_name":"Matroid partitioning","score":0.4968999922275543},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4596000015735626},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.42719998955726624},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.41940000653266907}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.8745999932289124},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7585999965667725},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6656000018119812},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6312999725341797},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5760999917984009},{"id":"https://openalex.org/C124344645","wikidata":"https://www.wikidata.org/wiki/Q7979897","display_name":"Weighted matroid","level":5,"score":0.560699999332428},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5386000275611877},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.4968999922275543},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4596000015735626},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.42719998955726624},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.41940000653266907},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39809998869895935},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3797999918460846},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3723999857902527},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.36959999799728394},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3463999927043915},{"id":"https://openalex.org/C133226019","wikidata":"https://www.wikidata.org/wiki/Q209812","display_name":"Linear span","level":2,"score":0.3452000021934509},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3384000062942505},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.2718000113964081},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.2662999927997589},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.259799987077713}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26075","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.39","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.39/LIPIcs.SWAT.2026.39.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.swat.2026.39","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.39","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26075","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.39","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.39/LIPIcs.SWAT.2026.39.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163897633.pdf","grobid_xml":"https://content.openalex.org/works/W7163897633.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,46,126],"consider":[1],"a":[2,32,48,82,129,149,205,214,223],"fast":[3,130],"approximation":[4,96],"algorithm":[5,52,97,103,134,153,168,175],"for":[6,71,135,154,210],"the":[7,27,64,78,91,101,136,140,171,219],"linear":[8,141,156,220],"matroid":[9,142,157],"intersection":[10,143,158],"problem.":[11,144],"In":[12,145],"this":[13],"problem,":[14],"we":[15,147,197],"are":[16,38],"given":[17,215],"two":[18],"r":[19],"\u00d7":[20],"n":[21,121],"matrices":[22],"M\u2081":[23,43],"and":[24,26,44,86,109],"M\u2082,":[25],"objective":[28],"is":[29,98,228],"to":[30],"find":[31],"largest":[33],"set":[34],"of":[35,66,81,139,222,225,229],"columns":[36],"that":[37],"linearly":[39],"independent":[40,84,230],"in":[41,69,116,184,218],"both":[42],"M\u2082.":[45],"design":[47,148],"(1":[49,131,150,172],"-":[50,123,132,151,173,190],"\u03b5)-approximation":[51,133,152,174],"with":[53,159,204],"time":[54,160],"complexity":[55,161],"O\u0303_{\u03b5}(nnz(M\u2081)":[56,162,185],"+":[57,59,118,120,163,165,186,188],"nnz(M\u2082)":[58,119,164,187],"r_{*}^{\u03c9}),":[60],"where":[61],"nnz(M_i)":[62],"denotes":[63,77,90],"number":[65],"nonzero":[67],"entries":[68],"M_i":[70],"i":[72],"=":[73],"1,":[74],"2,":[75],"r_{*}":[76],"maximum":[79],"size":[80],"common":[83],"set,":[85],"\u03c9":[87],"<":[88],"2.372":[89],"matrix":[92],"multiplication":[93],"exponent.":[94],"Our":[95,167],"faster":[99],"than":[100],"exact":[102],"by":[104,176],"Harvey":[105],"[FOCS'06":[106],"&":[107,112,179],"SICOMP'09]":[108],"Cheung-Kwok-Lau":[110],"[STOC'12":[111],"JACM'13],":[113],"which":[114,182,227],"runs":[115,183],"O\u0303(nnz(M\u2081)":[117],"r_{*}^{\u03c9":[122],"1})":[124,191],"time.":[125,192],"also":[127],"develop":[128],"weighted":[137,155],"version":[138],"fact,":[146],"r_{*}^{\u03c9}).":[166],"improves":[169],"upon":[170],"Huang-Kakimura-Kamiyama":[177],"[SODA'16":[178],"Math.":[180],"Program.'19],":[181],"nr_{*}^{\u03c9":[189],"To":[193],"obtain":[194],"these":[195],"results,":[196],"combine":[198],"Quanrud\u2019s":[199],"adaptive":[200],"sparsification":[201],"framework":[202],"[ICALP'24]":[203],"simple":[206],"yet":[207],"effective":[208],"method":[209],"efficiently":[211],"checking":[212],"whether":[213],"vector":[216],"lies":[217],"span":[221],"subset":[224],"vectors,":[226],"interest.":[231]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}