{"id":"https://openalex.org/W2142971798","doi":"https://doi.org/10.3390/a6010001","title":"Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability","display_name":"Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability","publication_year":2012,"publication_date":"2012-12-27","ids":{"openalex":"https://openalex.org/W2142971798","doi":"https://doi.org/10.3390/a6010001","mag":"2142971798"},"language":"en","primary_location":{"id":"doi:10.3390/a6010001","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6010001","pdf_url":"https://www.mdpi.com/1999-4893/6/1/1/pdf?version=1356617289","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/6/1/1/pdf?version=1356617289","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038691764","display_name":"Paola Bonizzoni","orcid":"https://orcid.org/0000-0001-7289-4988"},"institutions":[{"id":"https://openalex.org/I66752286","display_name":"University of Milano-Bicocca","ror":"https://ror.org/01ynf4891","country_code":"IT","type":"education","lineage":["https://openalex.org/I66752286"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Paola Bonizzoni","raw_affiliation_strings":["Department of Computer Systems and Communication, University of Milan-Bicocca, Viale Sarca 336, Milan, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Computer Systems and Communication, University of Milan-Bicocca, Viale Sarca 336, Milan, Italy","institution_ids":["https://openalex.org/I66752286"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110357719","display_name":"Riccardo Dondi","orcid":null},"institutions":[{"id":"https://openalex.org/I11039511","display_name":"University of Bergamo","ror":"https://ror.org/02mbd5571","country_code":"IT","type":"education","lineage":["https://openalex.org/I11039511"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Riccardo Dondi","raw_affiliation_strings":["Department of Humanities and Social Sciences, University of Bergamo, Via Donizzetti 3, Bergamo, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Humanities and Social Sciences, University of Bergamo, Via Donizzetti 3, Bergamo, Italy","institution_ids":["https://openalex.org/I11039511"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079127373","display_name":"Yuri Pirola","orcid":"https://orcid.org/0000-0002-8479-7592"},"institutions":[{"id":"https://openalex.org/I66752286","display_name":"University of Milano-Bicocca","ror":"https://ror.org/01ynf4891","country_code":"IT","type":"education","lineage":["https://openalex.org/I66752286"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Yuri Pirola","raw_affiliation_strings":["Department of Computer Systems and Communication, University of Milan-Bicocca, Viale Sarca 336, Milan, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Computer Systems and Communication, University of Milan-Bicocca, Viale Sarca 336, Milan, Italy","institution_ids":["https://openalex.org/I66752286"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5110357719"],"corresponding_institution_ids":["https://openalex.org/I11039511"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.6848,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.85072794,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"6","issue":"1","first_page":"1","last_page":"11"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9986000061035156,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8662089109420776},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.794405996799469},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6158978939056396},{"id":"https://openalex.org/keywords/colored","display_name":"Colored","score":0.5563673377037048},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5440911054611206},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5288832187652588},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5222328901290894},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4449799656867981},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44439664483070374},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40005677938461304},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3617645502090454}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8662089109420776},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.794405996799469},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6158978939056396},{"id":"https://openalex.org/C2778307483","wikidata":"https://www.wikidata.org/wiki/Q5149038","display_name":"Colored","level":2,"score":0.5563673377037048},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5440911054611206},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5288832187652588},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5222328901290894},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4449799656867981},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44439664483070374},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40005677938461304},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3617645502090454},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a6010001","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6010001","pdf_url":"https://www.mdpi.com/1999-4893/6/1/1/pdf?version=1356617289","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:aisberg.unibg.it:10446/29566","is_oa":false,"landing_page_url":"http://hdl.handle.net/10446/29566","pdf_url":null,"source":{"id":"https://openalex.org/S4377196347","display_name":"Aisberg (University of Bergamo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I11039511","host_organization_name":"University of Bergamo","host_organization_lineage":["https://openalex.org/I11039511"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:boa.unimib.it:10281/47903","is_oa":true,"landing_page_url":"http://hdl.handle.net/10281/47903","pdf_url":null,"source":{"id":"https://openalex.org/S4306401259","display_name":"BOA (University of Milano-Bicocca)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66752286","host_organization_name":"University of Milano-Bicocca","host_organization_lineage":["https://openalex.org/I66752286"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:ece660131ca8485e9b18d80e9c7b84cf","is_oa":true,"landing_page_url":"https://doaj.org/article/ece660131ca8485e9b18d80e9c7b84cf","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 6, Iss 1, Pp 1-11 (2012)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a6010001","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6010001","pdf_url":"https://www.mdpi.com/1999-4893/6/1/1/pdf?version=1356617289","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5699999928474426,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"},{"score":0.49000000953674316,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2142971798.pdf","grobid_xml":"https://content.openalex.org/works/W2142971798.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W950821216","https://openalex.org/W1500383076","https://openalex.org/W1517036688","https://openalex.org/W1531368347","https://openalex.org/W1568348011","https://openalex.org/W1970828859","https://openalex.org/W2018472652","https://openalex.org/W2034011726","https://openalex.org/W2038282261","https://openalex.org/W2043107521","https://openalex.org/W2051064851","https://openalex.org/W2061513598","https://openalex.org/W2086133268","https://openalex.org/W2104052983","https://openalex.org/W2126186592","https://openalex.org/W2137560895","https://openalex.org/W2152732502","https://openalex.org/W2296148711","https://openalex.org/W2486715098","https://openalex.org/W3104897947"],"related_works":["https://openalex.org/W2127420314","https://openalex.org/W166851098","https://openalex.org/W3103266813","https://openalex.org/W1034070228","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":{"The":[0],"problem":[1,52,71,90],"of":[2,7,38,64,79,98],"finding":[3],"the":[4,33,39,51,62,68,77,89,93,96,99],"maximum":[5],"number":[6,63,78,94],"vertex-disjoint":[8],"uni-color":[9],"paths":[10],"in":[11,19,24],"an":[12],"edge-colored":[13],"graph":[14],"has":[15],"been":[16],"recently":[17],"introduced":[18],"literature,":[20],"motivated":[21],"by":[22,76,92],"applications":[23],"social":[25],"network":[26],"analysis.":[27],"In":[28],"this":[29],"paper":[30],"we":[31,42,83],"investigate":[32],"approximation":[34],"and":[35,66,95],"parameterized":[36,91],"complexity":[37],"problem.":[40],"First,":[41],"show":[43],"that,":[44],"for":[45,88],"any":[46],"constant":[47],"\u03b5":[48],">":[49],"0,":[50],"is":[53,61,72],"not":[54],"approximable":[55],"within":[56],"factor":[57],"c1-\u03b5,":[58],"where":[59],"c":[60],"colors,":[65],"that":[67],"corresponding":[69],"decision":[70],"W[1]-hard":[73],"when":[74],"parametrized":[75],"disjoint":[80,100],"paths.":[81,101],"Then,":[82],"present":[84],"a":[85],"fixed-parameter":[86],"algorithm":[87],"length":[97]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}