Information Processing Letters最新文献_第9页

A short note on "A note on single-machine scheduling with job-dependent learning effects" 关于“具有作业依赖学习效应的单机调度问题”的说明

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2024-01-01 DOI: 10.1016/j.ipl.2023.106423

Dar-Li Yang, Yung-Tsung Hou, W. Kuo

引用次数: 0

On the hardness of inclusion-wise minimal separators enumeration 论包容性最小分离器枚举的难易程度

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2023-12-15 DOI: 10.1016/j.ipl.2023.106469

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>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 a-b 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 <math><mi>P</mi><mo>=</mo><mrow><mi>NP</mi></mrow></math>.</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}

引用次数: 0

Semantic flowers for good-for-games and deterministic automata 适合游戏和确定性自动机的语义花

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2023-12-02 DOI: 10.1016/j.ipl.2023.106468

Daniele Dell'Erba, Sven Schewe, Qiyi Tang, Tansholpan Zhanabekova

引用次数: 0

Approximation error of single hidden layer neural networks with fixed weights 固定权值的单隐层神经网络的逼近误差

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2023-12-01 DOI: 10.1016/j.ipl.2023.106467

Vugar E. Ismailov

引用次数: 0

Computing minimal solutions to the ring loading problem 计算环载荷问题的最小解

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2023-11-30 DOI: 10.1016/j.ipl.2023.106466

Nikolas Klug

引用次数: 0

On the complexity of co-secure dominating set problem 关于共安全控制集问题的复杂性

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2023-11-27 DOI: 10.1016/j.ipl.2023.106463

B.S. Panda , Soumyashree Rana , Sounaka Mishra

{"title":"On the complexity of co-secure dominating set problem","authors":"B.S. Panda , Soumyashree Rana , Sounaka Mishra","doi":"10.1016/j.ipl.2023.106463","DOIUrl":"https://doi.org/10.1016/j.ipl.2023.106463","url":null,"abstract":"<div>A set <math><mi>D</mi><mo>⊆</mo><mi>V</mi></math> of a graph <math><mi>G</mi><mo>=</mo><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>)</mo></math> is a dominating set of G if every vertex <math><mi>v</mi><mo>∈</mo><mi>V</mi><mo>∖</mo><mi>D</mi></math> is adjacent to at least one vertex in D. A set <math><mi>S</mi><mo>⊆</mo><mi>V</mi></math> is a co-secure dominating set (CSDS) of a graph G if S is a dominating set of G and for each vertex <math><mi>u</mi><mo>∈</mo><mi>S</mi></math> there exists a vertex <math><mi>v</mi><mo>∈</mo><mi>V</mi><mo>∖</mo><mi>S</mi></math> such that <math><mi>u</mi><mi>v</mi><mo>∈</mo><mi>E</mi></math> and <math><mo>(</mo><mi>S</mi><mo>∖</mo><mo>{</mo><mi>u</mi><mo>}</mo><mo>)</mo><mo>∪</mo><mo>{</mo><mi>v</mi><mo>}</mo></math> is a dominating set of G. The minimum cardinality of a co-secure dominating set of G is the co-secure domination number and it is denoted by <math><msub><mrow><mi>γ</mi></mrow><mrow><mi>c</mi><mi>s</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></math>. Given a graph <math><mi>G</mi><mo>=</mo><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>)</mo></math>, the minimum co-secure dominating set problem (Min Co-secure Dom) is to find a co-secure dominating set of minimum cardinality. In this paper, we strengthen the inapproximability result of Min Co-secure Dom for general graphs by showing that this problem can not be approximated within a factor of <math><mo>(</mo><mn>1</mn><mo>−</mo><mi>ε</mi><mo>)</mo><mi>ln</mi><mo>⁡</mo><mo>|</mo><mi>V</mi><mo>|</mo></math> for perfect elimination bipartite graphs and star convex bipartite graphs unless P=NP. On the positive side, we show that Min Co-secure Dom can be approximated within a factor of <math><mi>O</mi><mo>(</mo><mi>ln</mi><mo>⁡</mo><mo>|</mo><mi>V</mi><mo>|</mo><mo>)</mo></math> for any graph G with <math><mi>δ</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>≥</mo><mn>2</mn></math>. For 3-regular and 4-regular graphs, we show that Min Co-secure Dom is approximable within a factor of <math><mfrac><mrow><mn>8</mn></mrow><mrow><mn>3</mn></mrow></mfrac></math> and <math><mfrac><mrow><mn>10</mn></mrow><mrow><mn>3</mn></mrow></mfrac></math>, respectively. Furthermore, we prove that Min Co-secure Dom is APX-complete for 3-regular graphs.</div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"185 ","pages":"Article 106463"},"PeriodicalIF":0.5,"publicationDate":"2023-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138454038","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}

引用次数: 0

Deterministic treasure hunt and rendezvous in arbitrary connected graphs 任意连通图中的确定性寻宝与交会

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2023-10-23 DOI: 10.1016/j.ipl.2023.106455

Debasish Pattanayak, Andrzej Pelc

{"title":"Deterministic treasure hunt and rendezvous in arbitrary connected graphs","authors":"Debasish Pattanayak, Andrzej Pelc","doi":"10.1016/j.ipl.2023.106455","DOIUrl":"https://doi.org/10.1016/j.ipl.2023.106455","url":null,"abstract":"<div>Treasure hunt and rendezvous are fundamental tasks performed by mobile agents in graphs. In treasure hunt, an agent has to find an inert target (called treasure) situated at an unknown node of the graph. In rendezvous, two agents, initially located at distinct nodes of the graph, traverse its edges in synchronous rounds and have to meet at some node. We assume that the graph is connected (otherwise none of these tasks is feasible) and consider deterministic treasure hunt and rendezvous algorithms. The time of a treasure hunt algorithm is the worst-case number of edge traversals performed by the agent until the treasure is found. The time of a rendezvous algorithm is the worst-case number of rounds since the wakeup of the earlier agent until the meeting.To the best of our knowledge, all known treasure hunt and rendezvous algorithms rely on the assumption that degrees of all nodes are finite, even when the graph itself may be infinite. In the present paper we remove this assumption for the first time, and consider both above tasks in arbitrary connected graphs whose nodes can have either finite or countably infinite degrees. Our main result is the first universal treasure hunt algorithm working for arbitrary connected graphs. We prove that the time of this algorithm has optimal order of magnitude among all possible treasure hunt algorithms working for arbitrary connected graphs. As a consequence of this result we obtain the first universal rendezvous algorithm working for arbitrary connected graphs. The time of this algorithm is polynomial in a lower bound holding in many graphs, in particular in the tree all of whose degrees are infinite.</div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"185 ","pages":"Article 106455"},"PeriodicalIF":0.5,"publicationDate":"2023-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67739970","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}

引用次数: 0

The effect of iterativity on adversarial opinion forming 迭代对对抗性意见形成的影响

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2023-10-20 DOI: 10.1016/j.ipl.2023.106453

Konstantinos Panagiotou, Simon Reisser

引用次数: 0

Anti Tai mapping for unordered labeled trees 无序标记树的反Tai映射

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2023-10-20 DOI: 10.1016/j.ipl.2023.106454

Mislav Blažević , Stefan Canzar , Khaled Elbassioni , Domagoj Matijević

引用次数: 0

Discrete and mixed two-center problems for line segments 线段的离散和混合双中心问题