{"id":"https://openalex.org/W2125759243","doi":"https://doi.org/10.1007/s00453-015-0004-z","title":"Assigning Channels Via the Meet-in-the-Middle Approach","display_name":"Assigning Channels Via the Meet-in-the-Middle Approach","publication_year":2015,"publication_date":"2015-05-12","ids":{"openalex":"https://openalex.org/W2125759243","doi":"https://doi.org/10.1007/s00453-015-0004-z","mag":"2125759243"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-015-0004-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-015-0004-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-015-0004-z.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-015-0004-z.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084157220","display_name":"\u0141ukasz Kowalik","orcid":"https://orcid.org/0000-0002-7546-2969"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"\u0141ukasz Kowalik","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073398305","display_name":"Arkadiusz Soca\u0142a","orcid":null},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Arkadiusz Soca\u0142a","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5084157220"],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.08254251,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"74","issue":"4","first_page":"1435","last_page":"1452"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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.9980999827384949,"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/bounded-function","display_name":"Bounded function","score":0.7202817797660828},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7151761651039124},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6747392416000366},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6313046813011169},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6197484135627747},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5691857933998108},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.47713136672973633},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4572254717350006},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4408467710018158},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4246410131454468},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22906014323234558},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16769811511039734}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7202817797660828},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7151761651039124},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6747392416000366},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6313046813011169},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6197484135627747},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5691857933998108},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.47713136672973633},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4572254717350006},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4408467710018158},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4246410131454468},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22906014323234558},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16769811511039734},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-015-0004-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-015-0004-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-015-0004-z.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-015-0004-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-015-0004-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-015-0004-z.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":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2125759243.pdf","grobid_xml":"https://content.openalex.org/works/W2125759243.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W1515598460","https://openalex.org/W1770176175","https://openalex.org/W1808823193","https://openalex.org/W1953176910","https://openalex.org/W1985572324","https://openalex.org/W2045492613","https://openalex.org/W2056979696","https://openalex.org/W2074359677","https://openalex.org/W2092088134","https://openalex.org/W2096495231","https://openalex.org/W2104468092","https://openalex.org/W2154475159","https://openalex.org/W2159011960","https://openalex.org/W2178461450","https://openalex.org/W2610488209","https://openalex.org/W2766523368","https://openalex.org/W2963431443","https://openalex.org/W4236979639"],"related_works":["https://openalex.org/W2032550399","https://openalex.org/W2057791178","https://openalex.org/W2089439745","https://openalex.org/W4377371889","https://openalex.org/W2136838521","https://openalex.org/W2962917430","https://openalex.org/W4389362338","https://openalex.org/W2028468530","https://openalex.org/W2113623403","https://openalex.org/W2055932080"],"abstract_inverted_index":{"We":[0,52,93,109],"study":[1],"the":[2,5,11,19,26,43,48,57,61,70,128,131],"complexity":[3],"of":[4,63,89,130],"Channel":[6,23,75,107],"Assignment":[7,24,76],"problem.":[8],"By":[9],"applying":[10],"meet-in-the-middle":[12],"approach":[13],"we":[14],"get":[15],"an":[16],"algorithm":[17,45,55],"for":[18,84,98],"$$\\ell":[20,32,90],"$$":[21,33,91],"-bounded":[22],"(when":[25],"edge":[27],"weights":[28],"are":[29],"bounded":[30],"by":[31],")":[34],"running":[35],"in":[36],"time":[37],"$$O^*((2\\sqrt{\\ell":[38],"+1})^n)$$":[39],".":[40,92],"This":[41],"is":[42,127],"first":[44],"which":[46],"breaks":[47],"$$(O(\\ell":[49],"))^n$$":[50],"barrier.":[51],"extend":[53],"this":[54],"to":[56],"counting":[58],"variant,":[59],"at":[60],"cost":[62],"slightly":[64],"higher":[65],"polynomial":[66],"factor.":[67],"Very":[68],"recently":[69],"second":[71],"author":[72],"showed":[73],"that":[74,105,111],"does":[77,115],"not":[78,116],"admit":[79,117],"a":[80,85,95,102,118],"$$O(c^n)$$":[81],"-time":[82,123],"algorithm,":[83,124],"constant":[86],"c":[87],"independent":[88],"consider":[94],"similar":[96],"question":[97],"Generalized":[99,112],"$$T$$":[100,113],"-Coloring,":[101],"CSP":[103],"problem":[104],"generalizes":[106],"Assignment.":[108],"show":[110],"-Coloring":[114],"$$2^{2^{o\\left(":[119],"\\sqrt{n}\\right)":[120],"}}":[121],"\\mathrm{poly}(r)$$":[122],"where":[125],"r":[126],"size":[129],"instance.":[132]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}