{"id":"https://openalex.org/W3010440935","doi":"https://doi.org/10.4230/lipics.esa.2022.73","title":"Scheduling Kernels via Configuration LP","display_name":"Scheduling Kernels via Configuration LP","publication_year":2020,"publication_date":"2020-03-04","ids":{"openalex":"https://openalex.org/W3010440935","doi":"https://doi.org/10.4230/lipics.esa.2022.73","mag":"3010440935"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:17011","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.73","pdf_url":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.73","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073361240","display_name":"Du\u0161an Knop","orcid":"https://orcid.org/0000-0003-2588-5709"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Knop, Du\u0161an","raw_affiliation_strings":["Czech Technical Univ. in Prague"],"affiliations":[{"raw_affiliation_string":"Czech Technical Univ. in Prague","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030598218","display_name":"Martin Kouteck\u00fd","orcid":"https://orcid.org/0000-0002-7846-0053"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Kouteck\u00fd, Martin","raw_affiliation_strings":["Charles University in Prague"],"affiliations":[{"raw_affiliation_string":"Charles University in Prague","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073361240"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":0.18213818,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.55832824,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.996399998664856,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.9398758411407471},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7214094400405884},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6473169922828674},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5462568998336792},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4676852822303772},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46686482429504395},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4566967785358429},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.44111642241477966},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4376305639743805},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4350542426109314},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39016175270080566},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3891950845718384},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38690054416656494},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.08906027674674988}],"concepts":[{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.9398758411407471},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7214094400405884},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6473169922828674},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5462568998336792},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4676852822303772},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46686482429504395},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4566967785358429},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.44111642241477966},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4376305639743805},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4350542426109314},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39016175270080566},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3891950845718384},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38690054416656494},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.08906027674674988},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:17011","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.73","pdf_url":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:arXiv.org:2003.02187","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2003.02187","pdf_url":"https://arxiv.org/pdf/2003.02187","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:3010440935","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2003.02187.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.2003.02187","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2003.02187","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.esa.2022.73","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2022.73","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:17011","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.73","pdf_url":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.699999988079071,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1517036688","https://openalex.org/W1586971062","https://openalex.org/W1988328380","https://openalex.org/W2096291703","https://openalex.org/W2115082275","https://openalex.org/W2121016502","https://openalex.org/W2168633992","https://openalex.org/W2911549278","https://openalex.org/W2951385657","https://openalex.org/W2963004262","https://openalex.org/W2964835449","https://openalex.org/W2972880987","https://openalex.org/W3101862638","https://openalex.org/W3103589466","https://openalex.org/W3103988870"],"related_works":["https://openalex.org/W1777219914","https://openalex.org/W3103589466","https://openalex.org/W1553572425","https://openalex.org/W2949892875","https://openalex.org/W2950713857","https://openalex.org/W2769189507","https://openalex.org/W2556703148","https://openalex.org/W2145537424","https://openalex.org/W2788486812","https://openalex.org/W3018516877","https://openalex.org/W3012174575","https://openalex.org/W2963782499","https://openalex.org/W2108031738","https://openalex.org/W2952413470","https://openalex.org/W2952756102","https://openalex.org/W2104144451","https://openalex.org/W2541841001","https://openalex.org/W2083173650","https://openalex.org/W2225752832","https://openalex.org/W3213429012"],"abstract_inverted_index":{"Makespan":[0],"minimization":[1,86],"(on":[2],"parallel":[3],"identical":[4],"or":[5],"unrelated":[6,145],"machines)":[7],"is":[8,24,51,71,104,153,182,196,208,215,229,245],"arguably":[9],"the":[10,27,89,128,134,142,148,160,199,233,242,262],"most":[11],"natural":[12],"and":[13,163,237],"studied":[14,53],"scheduling":[15,222],"problem.":[16],"A":[17],"common":[18],"approach":[19],"in":[20,73,106,114,141,185,198,209,232,269],"practical":[21],"algorithm":[22,157],"design":[23],"to":[25,41,112,220],"reduce":[26],"size":[28,70,103,186],"of":[29,75,132,137,144,150,171,190,235,246],"a":[30,34,60,96,99,154,169,188,216,225,252],"given":[31,77],"instance":[32,68,101],"by":[33,88,187],"fast":[35],"preprocessing":[36],"step":[37],"while":[38],"being":[39],"able":[40],"recover":[42],"key":[43],"information":[44],"even":[45],"after":[46],"this":[47,109,118],"reduction.":[48],"This":[49,180],"notion":[50],"formally":[52],"as":[54],"kernelization":[55,97],"(or":[56],"simply,":[57],"kernel)":[58],"-":[59],"polynomial":[61,113,197,217,253,270,279],"time":[62,93],"procedure":[63],"which":[64,211],"yields":[65],"an":[66,172],"equivalent":[67],"whose":[69,102],"bounded":[72],"terms":[74],"some":[76],"parameter.":[78,155],"It":[79],"follows":[80],"from":[81],"known":[82],"results":[83],"that":[84,204,213,273],"makespan":[85,123],"parameterized":[87],"longest":[90],"job":[91],"processing":[92],"p_max":[94],"has":[95],"yielding":[98,224],"reduced":[100,111,184],"exponential":[105],"p_max.":[107],"Can":[108],"be":[110,267],"p_max?":[115],"We":[116],"answer":[117],"affirmatively":[119],"not":[120,277],"only":[121],"for":[122,127,255,282],"minimization,":[124],"but":[125],"also":[126,140],"(more":[129],"complicated)":[130],"objective":[131],"minimizing":[133],"weighted":[135],"sum":[136],"completion":[138],"times,":[139],"setting":[143],"machines":[146],"when":[147],"number":[149],"machine":[151],"kinds":[152],"Our":[156,227],"first":[158],"solves":[159],"Configuration":[161,243],"LP":[162,244],"based":[164],"on":[165,260],"its":[166,193],"solution":[167,170,181],"constructs":[168],"intermediate":[173],"problem,":[174,223],"called":[175],"huge":[176,205,256],"N-fold":[177,206,257],"integer":[178,274],"programming.":[179],"further":[183],"series":[189],"steps,":[191],"until":[192],"encoding":[194],"length":[195],"parameters.":[200],"Then,":[201],"we":[202,250],"show":[203,251],"IP":[207,258],"NP,":[210],"implies":[212],"there":[214],"reduction":[218],"back":[219],"our":[221,238,286],"kernel.":[226],"technique":[228],"highly":[230],"novel":[231],"context":[234],"kernelization,":[236],"structural":[239],"theorem":[240],"about":[241],"independent":[247],"interest.":[248],"Moreover,":[249],"kernel":[254],"conditional":[259],"whether":[261],"so-called":[263],"separation":[264],"subproblem":[265],"can":[266],"solved":[268],"time.":[271],"Considering":[272],"programming":[275],"does":[276],"admit":[278],"kernels":[280],"except":[281],"quite":[283],"restricted":[284],"cases,":[285],"\"conditional":[287],"kernel\"":[288],"provides":[289],"new":[290],"insight.":[291]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}