Information Processing Letters最新文献

{"title":"Counter abstraction for regular open teams","authors":"Shabana A.T.,&nbsp;Alphy George,&nbsp;S. Sheerazuddin","doi":"10.1016/j.ipl.2024.106533","DOIUrl":"10.1016/j.ipl.2024.106533","url":null,"abstract":"<div><p>We study <em>open swarms</em> and <em>teams</em> of multi-agent systems where agents may join or leave the system at runtime. Kouvaros et al. <span><span>[1]</span></span> defined the verification problem for such systems and showed it to be undecidable, in general. Also, they have found one decidable class of open multi-agent systems and provided a partial decision procedure for another. In the same vein we present a subclass of open teams called <em>regular open teams</em> for which reachability is decidable. This is shown by employing a counter abstraction technique wherein the regular open team is abstracted into a finite state multi-counter system.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"188 ","pages":"Article 106533"},"PeriodicalIF":0.7,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142240002","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 22k-approximation algorithm for minimum power k edge disjoint st-paths","authors":"Zeev Nutov","doi":"10.1016/j.ipl.2024.106532","DOIUrl":"10.1016/j.ipl.2024.106532","url":null,"abstract":"<div><p>In minimum power network design problems we are given an undirected graph <span><math><mi>G</mi><mo>=</mo><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>)</mo></math></span> with edge costs <span><math><mo>{</mo><msub><mrow><mi>c</mi></mrow><mrow><mi>e</mi></mrow></msub><mo>:</mo><mi>e</mi><mo>∈</mo><mi>E</mi><mo>}</mo></math></span>. The goal is to find an edge set <span><math><mi>F</mi><mo>⊆</mo><mi>E</mi></math></span> that satisfies a prescribed property of minimum power <span><math><msub><mrow><mi>p</mi></mrow><mrow><mi>c</mi></mrow></msub><mo>(</mo><mi>F</mi><mo>)</mo><mo>=</mo><msub><mrow><mo>∑</mo></mrow><mrow><mi>v</mi><mo>∈</mo><mi>V</mi></mrow></msub><mi>max</mi><mo>⁡</mo><mo>{</mo><msub><mrow><mi>c</mi></mrow><mrow><mi>e</mi></mrow></msub><mo>:</mo><mi>e</mi><mo>∈</mo><mi>F</mi><mtext> is incident to </mtext><mi>v</mi><mo>}</mo></math></span>. In the <span>Min-Power</span> <em>k</em> <span>Edge Disjoint</span> <em>st</em><span>-Paths</span> problem <em>F</em> should contain <em>k</em> edge disjoint <em>st</em>-paths. The problem admits a <em>k</em>-approximation algorithm, and it was an open question to achieve an approximation ratio sublinear in <em>k</em> for simple graphs, even for unit costs. We give a <span><math><mn>2</mn><msqrt><mrow><mn>2</mn><mi>k</mi></mrow></msqrt></math></span>-approximation algorithm for general costs.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"188 ","pages":"Article 106532"},"PeriodicalIF":0.7,"publicationDate":"2024-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142012369","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":"Luby's MIS algorithms made self-stabilizing","authors":"George Giakkoupis ,&nbsp;Volker Turau ,&nbsp;Isabella Ziccardi","doi":"10.1016/j.ipl.2024.106531","DOIUrl":"10.1016/j.ipl.2024.106531","url":null,"abstract":"<div><p>We reconsider two well-known distributed randomized algorithms computing a maximal independent set, proposed in the seminal work of Luby (1986). We enhance these algorithms such that they become self-stabilizing without sacrificing their run-time, i.e., both stabilize in <span><math><mi>O</mi><mo>(</mo><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span> synchronous rounds with high probability on any <em>n</em>-node graph. The first algorithm gets along with three states, but needs to know an upper bound on the maximum degree. The second does not need any information about the graph, but uses a number of states that is linear in the node degree. Both algorithms use messages of logarithmic size.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"188 ","pages":"Article 106531"},"PeriodicalIF":0.7,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0020019024000619/pdfft?md5=8797cfe630838abf367b5e1ac7c3484f&pid=1-s2.0-S0020019024000619-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141985068","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":"Algorithms for subgraph complementation to some classes of graphs","authors":"Dhanyamol Antony ,&nbsp;Sagartanu Pal ,&nbsp;R.B. Sandeep","doi":"10.1016/j.ipl.2024.106530","DOIUrl":"10.1016/j.ipl.2024.106530","url":null,"abstract":"<div><p>For a class <span><math><mi>G</mi></math></span> of graphs, the objective of <span>Subgraph Complementation to</span> <span><math><mi>G</mi></math></span> is to find whether there exists a subset <em>S</em> of vertices of the input graph <em>G</em> such that modifying <em>G</em> by complementing the subgraph induced by <em>S</em> results in a graph in <span><math><mi>G</mi></math></span>. We obtain a polynomial-time algorithm for the problem when <span><math><mi>G</mi></math></span> is the class of graphs with minimum degree at least <em>k</em>, for a constant <em>k</em>, answering an open problem by Fomin et al. (Algorithmica, 2020). When <span><math><mi>G</mi></math></span> is the class of graphs without any induced copies of the star graph on <span><math><mi>t</mi><mo>+</mo><mn>1</mn></math></span> vertices (for any constant <span><math><mi>t</mi><mo>≥</mo><mn>3</mn></math></span>) and diamond, we obtain a polynomial-time algorithm for the problem. This is in contrast with a result by Antony et al. (Algorithmica, 2022) that the problem is NP-complete and cannot be solved in subexponential-time (assuming the Exponential Time Hypothesis) when <span><math><mi>G</mi></math></span> is the class of graphs without any induced copies of the star graph on <span><math><mi>t</mi><mo>+</mo><mn>1</mn></math></span> vertices, for every constant <span><math><mi>t</mi><mo>≥</mo><mn>5</mn></math></span>.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"188 ","pages":"Article 106530"},"PeriodicalIF":0.7,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141985069","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":"4/3 rectangle tiling lower bound","authors":"Grzegorz Głuch,&nbsp;Krzysztof Loryś","doi":"10.1016/j.ipl.2024.106523","DOIUrl":"10.1016/j.ipl.2024.106523","url":null,"abstract":"<div><p>The problem that we consider is the following: given an <span><math><mi>n</mi><mo>×</mo><mi>n</mi></math></span> array <em>A</em> of positive numbers and a natural number <em>p</em>, find a tiling using at most <em>p</em> rectangles (which means that each array element must be covered by some rectangle and no two rectangles must overlap) that minimizes the maximum weight of any rectangle (the weight of a rectangle is the sum of elements which are covered by it). We prove that it is NP-hard to approximate this problem to within a factor of <strong>1</strong><span><math><mfrac><mrow><mn>1</mn></mrow><mrow><mn>3</mn></mrow></mfrac></math></span> (the previous best result was <span><math><mn>1</mn><mfrac><mrow><mn>1</mn></mrow><mrow><mn>4</mn></mrow></mfrac></math></span>).</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"188 ","pages":"Article 106523"},"PeriodicalIF":0.7,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141940421","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":"Robust probabilistic temporal logics","authors":"Martin Zimmermann","doi":"10.1016/j.ipl.2024.106522","DOIUrl":"10.1016/j.ipl.2024.106522","url":null,"abstract":"<div><p>We robustify PCTL and PCTL^⁎, the most important specification languages for probabilistic systems, and show that robustness does not increase the complexity of their model-checking problems.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"188 ","pages":"Article 106522"},"PeriodicalIF":0.7,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0020019024000528/pdfft?md5=a8b85e941455bedd212a2027c3c635b8&pid=1-s2.0-S0020019024000528-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141940422","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":"Algorithmic aspects of {Pk}-isolation in graphs and extremal graphs for a {P3}-isolation bound","authors":"Jie Chen ,&nbsp;Yi-Ping Liang ,&nbsp;Cai-Xia Wang ,&nbsp;Shou-Jun Xu","doi":"10.1016/j.ipl.2024.106521","DOIUrl":"10.1016/j.ipl.2024.106521","url":null,"abstract":"<div><p>A subset <em>S</em> of the vertex set of a graph <em>G</em> is an <span><math><mi>F</mi></math></span><em>-isolating set</em> of <em>G</em> if <span><math><mi>G</mi><mo>−</mo><mi>N</mi><mo>[</mo><mi>S</mi><mo>]</mo></math></span> does not contain a copy of a member of <span><math><mi>F</mi></math></span> as a subgraph, where <span><math><mi>F</mi></math></span> is a family of connected graphs and <span><math><mi>N</mi><mo>[</mo><mi>S</mi><mo>]</mo></math></span> is the closed neighborhood of <em>S</em>. The <span><math><mi>F</mi></math></span><em>-isolation number</em> of <em>G</em> is the minimum cardinality of an <span><math><mi>F</mi></math></span>-isolating set of <em>G</em>, denoted by <span><math><mi>ι</mi><mo>(</mo><mi>G</mi><mo>,</mo><mi>F</mi><mo>)</mo></math></span>. Given a graph <em>G</em>, <span><math><mo>{</mo><msub><mrow><mi>P</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>}</mo></math></span>-ISOLATION asks for the size of a smallest <span><math><mo>{</mo><msub><mrow><mi>P</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>}</mo></math></span>-isolating set of <em>G</em> for a fixed positive integer <em>k</em>, where <span><math><msub><mrow><mi>P</mi></mrow><mrow><mi>k</mi></mrow></msub></math></span> is a path of order <em>k</em>. In this paper, we first show that the decision version of <span><math><mo>{</mo><msub><mrow><mi>P</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>}</mo></math></span>-ISOLATION is NP-complete for chordal graphs and planar graphs. Secondly, we propose a linear time algorithm to compute a smallest <span><math><mo>{</mo><msub><mrow><mi>P</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>}</mo></math></span>-isolating set of a tree. Finally, we solve the problem of characterizing the connected graphs <em>G</em> with <span><math><mi>ι</mi><mo>(</mo><mi>G</mi><mo>,</mo><mo>{</mo><msub><mrow><mi>P</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>}</mo><mo>)</mo><mo>=</mo><mfrac><mrow><mn>2</mn></mrow><mrow><mn>7</mn></mrow></mfrac><mo>|</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>|</mo></math></span>, proposed by Zhang and Wu [Discrete Appl. Math. 304 (2021) 365-374].</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"187 ","pages":"Article 106521"},"PeriodicalIF":0.7,"publicationDate":"2024-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141629965","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":"Defying gravity and gadget numerosity: The complexity of the Hanano Puzzle and beyond","authors":"Michael C. Chavrimootoo","doi":"10.1016/j.ipl.2024.106520","DOIUrl":"https://doi.org/10.1016/j.ipl.2024.106520","url":null,"abstract":"<div><p>Using the notion of visibility representations, our paper establishes a new property of instances of the Nondeterministic Constraint Logic (NCL) problem (a PSPACE-complete problem that is very convenient to prove the PSPACE-hardness of reversible games with pushing blocks). Direct use of this property introduces an explosion in the number of gadgets needed to show PSPACE-hardness, but we show how to bring that number from 32 down to only three in the general case, and down to two in our specific case! We propose it as a step towards a broader and more general framework for studying games with irreversible gravity, and use this connection to guide an indirect polynomial-time many-one reduction from the NCL problem to the Hanano Puzzle—which is NP-hard—to prove it is PSPACE-complete.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"187 ","pages":"Article 106520"},"PeriodicalIF":0.7,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141605828","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":"Weighted fair division of indivisible items: A review","authors":"Warut Suksompong","doi":"10.1016/j.ipl.2024.106519","DOIUrl":"https://doi.org/10.1016/j.ipl.2024.106519","url":null,"abstract":"<div><p>Fair division is a longstanding problem in economics and has recently received substantial interest in computer science. Several applications of fair division involve agents with unequal entitlements represented by weights. We review work on weighted fair division of indivisible items, discuss the range of weighted fairness notions that have been proposed, and highlight a number of open questions.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"187 ","pages":"Article 106519"},"PeriodicalIF":0.7,"publicationDate":"2024-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0020019024000498/pdfft?md5=542bbcb05fc9701066d615985a892ca7&pid=1-s2.0-S0020019024000498-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141483424","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":"Hamiltonian cycles of balanced hypercube with disjoint faulty edges","authors":"Ting Lan,&nbsp;Huazhong Lü","doi":"10.1016/j.ipl.2024.106518","DOIUrl":"https://doi.org/10.1016/j.ipl.2024.106518","url":null,"abstract":"<div><p>The balanced hypercube <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, a variant of the hypercube, is a novel interconnection network topology for massive parallel systems. It is showed in [Theor. Comput. Sci. 947 (2023) 113708] that for any edge subset <em>F</em> of <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> there exists a fault-free Hamiltonian cycle in <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>−</mo><mi>F</mi></math></span> for <span><math><mi>n</mi><mo>≥</mo><mn>2</mn></math></span> with <span><math><mrow><mo>|</mo><mi>F</mi><mo>|</mo></mrow><mo>≤</mo><mn>5</mn><mi>n</mi><mo>−</mo><mn>7</mn></math></span> if the degree of every vertex in <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>−</mo><mi>F</mi></math></span> is at least two and there exist no <span><math><msub><mrow><mi>f</mi></mrow><mrow><mn>4</mn></mrow></msub></math></span>-cycles in <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>−</mo><mi>F</mi></math></span>. In this paper, we consider the existence of Hamiltonian cycles of <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> when <em>F</em> is a matching (a set of disjoint edges), and show that each edge <span><math><mi>e</mi><mo>∉</mo><mi>F</mi></math></span> lies on a fault-free Hamiltonian cycle of <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>−</mo><mi>F</mi></math></span> with <span><math><mi>n</mi><mo>≥</mo><mn>2</mn></math></span>. The number of faulty edges in <em>F</em> can be up to <span><math><msup><mrow><mn>2</mn></mrow><mrow><mn>2</mn><mi>n</mi><mo>−</mo><mn>1</mn></mrow></msup></math></span>, which is exponential to the dimension <em>n</em>.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"187 ","pages":"Article 106518"},"PeriodicalIF":0.7,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141483423","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}