Information Processing Letters最新文献_第7页

Branching bisimulation semantics for quantum processes 量子过程的分支双拟态语义

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2024-03-16 DOI: 10.1016/j.ipl.2024.106492

Hao Wu , Qizhe Yang , Huan Long

引用次数: 0

Smaller kernels for two vertex deletion problems 两个顶点删除问题的较小内核

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2024-03-15 DOI: 10.1016/j.ipl.2024.106493

Dekel Tsur

{"title":"Smaller kernels for two vertex deletion problems","authors":"Dekel Tsur","doi":"10.1016/j.ipl.2024.106493","DOIUrl":"https://doi.org/10.1016/j.ipl.2024.106493","url":null,"abstract":"<div>In this paper we consider two vertex deletion problems. In the Block Vertex Deletion problem, the input is a graph G and an integer k, and the goal is to decide whether there is a set of at most k vertices whose removal from G result in a block graph (a graph in which every biconnected component is a clique). In the Pathwidth One Vertex Deletion problem, the input is a graph G and an integer k, and the goal is to decide whether there is a set of at most k vertices whose removal from G result in a graph with pathwidth at most one. We give a kernel for Block Vertex Deletion with <math><mi>O</mi><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>3</mn></mrow></msup><mo>)</mo></math> vertices and a kernel for Pathwidth One Vertex Deletion with <math><mi>O</mi><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math> vertices. Our results improve the previous <math><mi>O</mi><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>4</mn></mrow></msup><mo>)</mo></math>-vertex kernel for Block Vertex Deletion (Agrawal et al., 2016 [1]) and the <math><mi>O</mi><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>3</mn></mrow></msup><mo>)</mo></math>-vertex kernel for Pathwidth One Vertex Deletion (Cygan et al., 2012 [3]).</div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"186 ","pages":"Article 106493"},"PeriodicalIF":0.5,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140160714","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

Long directed detours: Reduction to 2-Disjoint Paths 长定向迂回：还原为二叉路径

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2024-03-13 DOI: 10.1016/j.ipl.2024.106491

Ashwin Jacob, Michał Włodarczyk, Meirav Zehavi

{"title":"Long directed detours: Reduction to 2-Disjoint Paths","authors":"Ashwin Jacob, Michał Włodarczyk, Meirav Zehavi","doi":"10.1016/j.ipl.2024.106491","DOIUrl":"10.1016/j.ipl.2024.106491","url":null,"abstract":"<div>In the Longest <math><mo>(</mo><mi>s</mi><mo>,</mo><mi>t</mi><mo>)</mo></math>-Detour problem, we look for an <math><mo>(</mo><mi>s</mi><mo>,</mo><mi>t</mi><mo>)</mo></math>-path that is at least k vertices longer than a shortest one. We study the parameterized complexity of Longest <math><mo>(</mo><mi>s</mi><mo>,</mo><mi>t</mi><mo>)</mo></math>-Detour when parameterized by k: this falls into the research paradigm of ‘parameterization above guarantee’. Whereas the problem is known to be fixed-parameter tractable (FPT) on undirected graphs, the status of Longest <math><mo>(</mo><mi>s</mi><mo>,</mo><mi>t</mi><mo>)</mo></math>-Detour on directed graphs remains highly unclear: it is not even known to be solvable in polynomial time for <math><mi>k</mi><mo>=</mo><mn>1</mn></math>. Recently, Fomin et al. made progress in this direction by showing that the problem is FPT on every class of directed graphs where the 3-Disjoint Paths problem is solvable in polynomial time. We improve upon their result by weakening this assumption: we show that only a polynomial-time algorithm for 2-Disjoint Paths is required.</div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"186 ","pages":"Article 106491"},"PeriodicalIF":0.5,"publicationDate":"2024-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140153962","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

Sparsifying Count Sketch 稀疏化计数草图

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2024-02-29 DOI: 10.1016/j.ipl.2024.106490

Bhisham Dev Verma , Rameshwar Pratap , Punit Pankaj Dubey

{"title":"Sparsifying Count Sketch","authors":"Bhisham Dev Verma , Rameshwar Pratap , Punit Pankaj Dubey","doi":"10.1016/j.ipl.2024.106490","DOIUrl":"https://doi.org/10.1016/j.ipl.2024.106490","url":null,"abstract":"<div>The seminal work of Charikar et al. [1] called Count-Sketch suggests a sketching algorithm for real-valued vectors that has been used in frequency estimation for data streams and pairwise inner product estimation for real-valued vectors etc. One of the major advantages of Count-Sketch over other similar sketching algorithms, such as random projection, is that its running time, as well as the sparsity of sketch, depends on the sparsity of the input. Therefore, sparse datasets enjoy space-efficient (sparse sketches) and faster running time. However, on dense datasets, these advantages of Count-Sketch might be negligible over other baselines. In this work, we address this challenge by suggesting a simple and effective approach that outputs (asymptotically) a sparser sketch than that obtained via Count-Sketch, and as a by-product, we also achieve a faster running time. Simultaneously, the quality of our estimate is closely approximate to that of Count-Sketch. For frequency estimation and pairwise inner product estimation problems, our proposal Sparse-Count-Sketch provides unbiased estimates. These estimations, however, have slightly higher variances than their respective estimates obtained via Count-Sketch. To address this issue, we present improved estimators for these problems based on maximum likelihood estimation (MLE) that offer smaller variances even w.r.t. Count-Sketch. We suggest a rigorous theoretical analysis of our proposal for frequency estimation for data streams and pairwise inner product estimation for real-valued vectors.</div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"186 ","pages":"Article 106490"},"PeriodicalIF":0.5,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140042110","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

Red Blue Set Cover problem on axis-parallel hyperplanes and other objects 轴平行超平面和其他物体上的红蓝套覆盖问题

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2024-02-29 DOI: 10.1016/j.ipl.2024.106485

V.P. Abidha , Pradeesha Ashok

{"title":"Red Blue Set Cover problem on axis-parallel hyperplanes and other objects","authors":"V.P. Abidha , Pradeesha Ashok","doi":"10.1016/j.ipl.2024.106485","DOIUrl":"https://doi.org/10.1016/j.ipl.2024.106485","url":null,"abstract":"<div>Given a universe <math><mi>U</mi><mo>=</mo><mi>R</mi><mo>∪</mo><mi>B</mi></math> of a finite set of red elements R, and a finite set of blue elements B and a family <math><mi>F</mi></math> of subsets of <math><mi>U</mi></math>, the Red Blue Set Cover problem is to find a subset <math><msup><mrow><mi>F</mi></mrow><mrow><mo>′</mo></mrow></msup></math> of <math><mi>F</mi></math> that covers all blue elements of B and minimum number of red elements from R.We prove that the Red Blue Set Cover problem is NP-hard even when R and B respectively are sets of red and blue points in <math><msup><mrow><mi>IR</mi></mrow><mrow><mn>2</mn></mrow></msup></math> and the sets in <math><mi>F</mi></math> are defined by axis−parallel lines i.e., every set is a maximal set of points with the same x or y coordinate.We then study the parameterized complexity of a generalization of this problem, where <math><mi>U</mi></math> is a set of points in <math><msup><mrow><mi>IR</mi></mrow><mrow><mi>d</mi></mrow></msup></math> and <math><mi>F</mi></math> is a collection of set of axis−parallel hyperplanes in <math><msup><mrow><mi>IR</mi></mrow><mrow><mi>d</mi></mrow></msup></math> under different parameterizations, where d is a constant. For every parameter, we show that the problem is fixed-parameter tractable and also show the existence of a polynomial kernel. We further consider the Red Blue Set Cover problem for some special types of rectangles in <math><msup><mrow><mi>IR</mi></mrow><mrow><mn>2</mn></mrow></msup></math>.</div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"186 ","pages":"Article 106485"},"PeriodicalIF":0.5,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140042109","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 group factorization problem in finite groups of Lie type 有限列群的群因式分解问题

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2024-02-28 DOI: 10.1016/j.ipl.2024.106484

Haibo Hong, Shi Bai, Fenghao Liu

引用次数: 0

Regular resolution effectively simulates resolution 常规分辨率有效模拟分辨率

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2024-02-28 DOI: 10.1016/j.ipl.2024.106489

Sam Buss , Emre Yolcu

引用次数: 0

Learning-augmented maximum flow 学习增强最大流量

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2024-02-28 DOI: 10.1016/j.ipl.2024.106487

Adam Polak , Maksym Zub

{"title":"Learning-augmented maximum flow","authors":"Adam Polak , Maksym Zub","doi":"10.1016/j.ipl.2024.106487","DOIUrl":"https://doi.org/10.1016/j.ipl.2024.106487","url":null,"abstract":"<div>We propose a framework for speeding up maximum flow computation by using predictions. A prediction is a flow, i.e., an assignment of non-negative flow values to edges, which satisfies the flow conservation property, but does not necessarily respect the edge capacities of the actual instance (since these were unknown at the time of learning). We present an algorithm that, given an m-edge flow network and a predicted flow, computes a maximum flow in <math><mi>O</mi><mo>(</mo><mi>m</mi><mi>η</mi><mo>)</mo></math> time, where η is the <math><msub><mrow><mi>ℓ</mi></mrow><mrow><mn>1</mn></mrow></msub></math> error of the prediction, i.e., the sum over the edges of the absolute difference between the predicted and optimal flow values. Moreover, we prove that, given an oracle access to a distribution over flow networks, it is possible to efficiently PAC-learn a prediction minimizing the expected <math><msub><mrow><mi>ℓ</mi></mrow><mrow><mn>1</mn></mrow></msub></math> error over that distribution. Our results fit into the recent line of research on learning-augmented algorithms, which aims to improve over worst-case bounds of classical algorithms by using predictions, e.g., machine-learned from previous similar instances. So far, the main focus in this area was on improving competitive ratios for online problems. Following Dinitz et al. (2021) [6], our results are among the firsts to improve the running time of an offline problem.</div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"186 ","pages":"Article 106487"},"PeriodicalIF":0.5,"publicationDate":"2024-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140030945","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

Prenex universal first-order safety properties Prenex 通用一阶安全特性

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2024-02-28 DOI: 10.1016/j.ipl.2024.106488

Besik Dundua , Ioane Kapanadze , Helmut Seidl

引用次数: 0

Tight inapproximability of Nash equilibria in public goods games 公共物品博弈中纳什均衡的严密不可逼近性

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2024-02-27 DOI: 10.1016/j.ipl.2024.106486

Jérémi Do Dinh , Alexandros Hollender

引用次数: 0