{"title":"Robust scheduling for minimizing maximum lateness on a serial-batch processing machine","authors":"Wei Wu , Liang Tang , Andrea Pizzuti","doi":"10.1016/j.ipl.2024.106473","DOIUrl":"10.1016/j.ipl.2024.106473","url":null,"abstract":"<div><p>We study a robust single-machine scheduling problem with uncertain processing times on a serial-batch processing machine to minimize maximum lateness. The problem can model many practical production and logistics applications which involve uncertain factors such as defect rates. A solution to a batch scheduling problem can be represented as a combination of a job-processing sequence and a partition of this sequence (batch sizing). To solve the problem, we prove that the job ordering rule for the earliest due date is optimal for any uncertainty set. For the batch sizing problem, we propose an exact algorithm based on dynamic programming with the same time complexity as solving the nominal problem.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"186 ","pages":"Article 106473"},"PeriodicalIF":0.5,"publicationDate":"2024-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139585590","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Liyu Zhang, Mahmoud Quweider, Fitra Khan, Hansheng Lei
{"title":"Splitting NP-complete sets infinitely","authors":"Liyu Zhang, Mahmoud Quweider, Fitra Khan, Hansheng Lei","doi":"10.1016/j.ipl.2024.106472","DOIUrl":"10.1016/j.ipl.2024.106472","url":null,"abstract":"<div><p>Glaßer et al. (SIAMJCOMP 2009 and TCS 2009) proved that NP-complete languages are polynomial-time mitotic for the many-one reduction, meaning that each NP-complete language <em>L</em> can be split into two NP-complete languages <span><math><mi>L</mi><mo>∩</mo><mi>S</mi></math></span> and <span><math><mi>L</mi><mo>∩</mo><mover><mrow><mi>S</mi></mrow><mo>‾</mo></mover></math></span>, where <em>S</em> is a language in P. It follows that every NP-complete language can be partitioned into an arbitrary <em>finite</em> number of NP-complete languages. We strengthen and generalize this result by showing that every NP-complete language can be partitioned into <em>infinitely</em> many NP-complete languages. Furthermore those NP-complete languages resulting from such partitioning can be <em>effectively presented</em>.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"186 ","pages":"Article 106472"},"PeriodicalIF":0.5,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139518105","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Fedor V. Fomin , Petr A. Golovach , Tanmay Inamdar , Tomohiro Koana
{"title":"FPT approximation and subexponential algorithms for covering few or many edges","authors":"Fedor V. Fomin , Petr A. Golovach , Tanmay Inamdar , Tomohiro Koana","doi":"10.1016/j.ipl.2024.106471","DOIUrl":"10.1016/j.ipl.2024.106471","url":null,"abstract":"<div><p>We study the <em>α</em><span>-Fixed Cardinality Graph Partitioning (</span><em>α</em><span>-FCGP)</span> problem, the generic local graph partitioning problem introduced by Bonnet et al. [Algorithmica 2015]. In this problem, we are given a graph <em>G</em>, two numbers <span><math><mi>k</mi><mo>,</mo><mi>p</mi></math></span> and <span><math><mn>0</mn><mo>≤</mo><mi>α</mi><mo>≤</mo><mn>1</mn></math></span>, the question is whether there is a set <span><math><mi>S</mi><mo>⊆</mo><mi>V</mi></math></span> of size <em>k</em> with a specified coverage function <span><math><msub><mrow><mi>cov</mi></mrow><mrow><mi>α</mi></mrow></msub><mo>(</mo><mi>S</mi><mo>)</mo></math></span> at least <em>p</em> (or at most <em>p</em> for the minimization version). The coverage function <span><math><msub><mrow><mi>cov</mi></mrow><mrow><mi>α</mi></mrow></msub><mo>(</mo><mo>⋅</mo><mo>)</mo></math></span> counts edges with exactly one endpoint in <em>S</em> with weight <em>α</em> and edges with both endpoints in <em>S</em> with weight <span><math><mn>1</mn><mo>−</mo><mi>α</mi></math></span>. <em>α</em>-FCGP generalizes a number of fundamental graph problems such as <span>Densest</span> <em>k</em><span>-Subgraph</span>, <span>Max</span> <em>k</em><span>-Vertex Cover</span>, and <span>Max</span> <span><math><mo>(</mo><mi>k</mi><mo>,</mo><mi>n</mi><mo>−</mo><mi>k</mi><mo>)</mo></math></span><span>-Cut</span>.</p><p>A natural question in the study of <em>α</em>-FCGP is whether the algorithmic results known for its special cases, like <span>Max</span> <em>k</em><span>-Vertex Cover</span>, could be extended to more general settings. One of the simple but powerful methods for obtaining parameterized approximation [Manurangsi, SOSA 2019] and subexponential algorithms [Fomin et al. IPL 2011] for <span>Max</span> <em>k</em><span>-Vertex Cover</span> is based on the greedy vertex degree orderings. The main insight of our work is that the idea of greedy vertex degree ordering could be used to design fixed-parameter approximation schemes (FPT-AS) for <span><math><mi>α</mi><mo>></mo><mn>0</mn></math></span> and subexponential-time algorithms for the problem on apex-minor free graphs for maximization with <span><math><mi>α</mi><mo>></mo><mn>1</mn><mo>/</mo><mn>3</mn></math></span> and minimization with <span><math><mi>α</mi><mo><</mo><mn>1</mn><mo>/</mo><mn>3</mn></math></span>.<span><sup>4</sup></span></p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"185 ","pages":"Article 106471"},"PeriodicalIF":0.5,"publicationDate":"2024-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0020019024000012/pdfft?md5=dbf0e44d15c4aa0bfc53c54ec0a43a71&pid=1-s2.0-S0020019024000012-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139408753","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On-line exploration of rectangular cellular environments with a rectangular hole","authors":"Qi Wei , Xiaolin Yao , Wenxin Zhang , Ruiyue Zhang , Yonggong Ren","doi":"10.1016/j.ipl.2023.106470","DOIUrl":"10.1016/j.ipl.2023.106470","url":null,"abstract":"<div><p>This paper considers the problem of exploring an unknown rectangular cellular environment with a rectangular hole using a mobile robot. The robot's task is to visit each cell at least once and return to the start. The robot has limited visibility that can only detect four cells adjacent to it. And it has large amount of memory that can store a map of discovered cells. The goal of this work is to find the shortest exploration tour, that is, minimizing the total number of multiple visited cells. We consider the environment in four possible scenarios: rectangular, <em>L</em>-shaped, <em>C</em>-shaped or <em>O</em>-shaped grid polygon. An on-line strategy has been proposed for these scenarios. We prove that it is optimal for rectangular, <em>L</em>-shaped, <em>C</em>-shaped grid polygon, and is 4/3-competitive for <em>O</em>-shaped grid polygon.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"185 ","pages":"Article 106470"},"PeriodicalIF":0.5,"publicationDate":"2024-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139409511","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Araújo, Victor A. Campos, D. Girão, J. Nogueira, António Salgueiro, Ana Silva
{"title":"On the hull number on cycle convexity of graphs","authors":"J. Araújo, Victor A. Campos, D. Girão, J. Nogueira, António Salgueiro, Ana Silva","doi":"10.1016/j.ipl.2023.106420","DOIUrl":"https://doi.org/10.1016/j.ipl.2023.106420","url":null,"abstract":"","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"61 1","pages":"106420"},"PeriodicalIF":0.5,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"54535832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A new key recovery attack on a code-based signature from the Lyubashevsky framework","authors":"C. H. Tan, Theo Fanuela Prabowo","doi":"10.1016/j.ipl.2023.106422","DOIUrl":"https://doi.org/10.1016/j.ipl.2023.106422","url":null,"abstract":"","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"183 1","pages":"106422"},"PeriodicalIF":0.5,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"54535916","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A short note on \"A note on single-machine scheduling with job-dependent learning effects\"","authors":"Dar-Li Yang, Yung-Tsung Hou, W. Kuo","doi":"10.1016/j.ipl.2023.106423","DOIUrl":"https://doi.org/10.1016/j.ipl.2023.106423","url":null,"abstract":"","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"183 1","pages":"106423"},"PeriodicalIF":0.5,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"54536044","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Caroline Brosse , Oscar Defrain , Kazuhiro Kurita , Vincent Limouzy , Takeaki Uno , Kunihiro Wasa
{"title":"On the hardness of inclusion-wise minimal separators enumeration","authors":"Caroline Brosse , Oscar Defrain , Kazuhiro Kurita , Vincent Limouzy , Takeaki Uno , Kunihiro Wasa","doi":"10.1016/j.ipl.2023.106469","DOIUrl":"10.1016/j.ipl.2023.106469","url":null,"abstract":"<div><p><span>Enumeration problems are often encountered as key subroutines in the exact computation of graph parameters such as chromatic number, treewidth, or treedepth. In the case of treedepth computation, the enumeration of inclusion-wise minimal separators plays a crucial role. However and quite surprisingly, the complexity status of this problem has not been settled since it has been posed as an open direction by Kloks and Kratsch in 1998. Recently at the PACE 2020 competition dedicated to treedepth computation, solvers have been circumventing that by listing all minimal </span><em>a</em>-<em>b</em> separators and filtering out those that are not inclusion-wise minimal, at the cost of efficiency. Naturally, having an efficient algorithm for listing inclusion-wise minimal separators would drastically improve such practical algorithms. In this note, however, we show that no efficient algorithm is to be expected from an output-sensitive perspective, namely, we prove that there is no output-polynomial time algorithm for inclusion-wise minimal separators enumeration unless <span><math><mi>P</mi><mo>=</mo><mrow><mi>NP</mi></mrow></math></span>.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"185 ","pages":"Article 106469"},"PeriodicalIF":0.5,"publicationDate":"2023-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138684935","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Daniele Dell'Erba, Sven Schewe, Qiyi Tang, Tansholpan Zhanabekova
{"title":"Semantic flowers for good-for-games and deterministic automata","authors":"Daniele Dell'Erba, Sven Schewe, Qiyi Tang, Tansholpan Zhanabekova","doi":"10.1016/j.ipl.2023.106468","DOIUrl":"10.1016/j.ipl.2023.106468","url":null,"abstract":"<div><p>We present an innovative approach for capturing the complexity of <em>ω</em>-regular languages using the concept of <em>flowers</em>. This semantic tool combines two syntax-based definitions, namely the Mostowski hierarchy of word languages and syntactic flowers. The former is based on deterministic parity automata with a limited number of priorities, while the latter simplifies deterministic parity automata by reducing the number of priorities used, without altering their structure. Synthesising these two approaches yields a semantic concept of flowers, which offers a more effective way of dealing with the complexity of <em>ω</em>-regular languages. This letter provides a comprehensive definition of semantic flowers and shows that it captures the complexity of <em>ω</em>-regular languages. We also show that this natural concept yields simple proofs of the expressive power of good-for-games automata.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"185 ","pages":"Article 106468"},"PeriodicalIF":0.5,"publicationDate":"2023-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0020019023001114/pdfft?md5=173be998b22c22ffaed2da451d27431e&pid=1-s2.0-S0020019023001114-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138536269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Approximation error of single hidden layer neural networks with fixed weights","authors":"Vugar E. Ismailov","doi":"10.1016/j.ipl.2023.106467","DOIUrl":"https://doi.org/10.1016/j.ipl.2023.106467","url":null,"abstract":"<div><p><span><span>Neural networks with finitely many fixed weights have the universal </span>approximation property under certain conditions on compact subsets of the </span><em>d</em>-dimensional Euclidean space, where approximation process is considered. Such conditions were delineated in our paper <span>[26]</span><span>. But for many compact sets it is impossible to approximate multivariate functions with arbitrary precision and the question on estimation or efficient computation of approximation error arises. This paper provides an explicit formula for the approximation error of single hidden layer neural networks with two fixed weights.</span></p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"185 ","pages":"Article 106467"},"PeriodicalIF":0.5,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138501041","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}