Information Processing Letters最新文献_第8页

Top-down complementation of automata on finite trees 有限树上自动机的自顶向下互补

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2024-05-03 DOI: 10.1016/j.ipl.2024.106499

Laurent Doyen

引用次数: 0

Dispersion problem on a convex polygon 凸多边形上的分散问题

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2024-04-30 DOI: 10.1016/j.ipl.2024.106498

Pawan K. Mishra , S.V. Rao , Gautam K. Das

{"title":"Dispersion problem on a convex polygon","authors":"Pawan K. Mishra , S.V. Rao , Gautam K. Das","doi":"10.1016/j.ipl.2024.106498","DOIUrl":"https://doi.org/10.1016/j.ipl.2024.106498","url":null,"abstract":"<div>Given a set <math><mi>P</mi><mo>=</mo><mo>{</mo><msub><mrow><mi>p</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>p</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>p</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>}</mo></math> of n points in <math><msup><mrow><mi>R</mi></mrow><mrow><mn>2</mn></mrow></msup></math> and a positive integer k <math><mo>(</mo><mo>≤</mo><mi>n</mi><mo>)</mo></math>, we wish to find a subset S of P of size k such that the cost of a subset S, <math><mi>c</mi><mi>o</mi><mi>s</mi><mi>t</mi><mo>(</mo><mi>S</mi><mo>)</mo><mo>=</mo><mi>min</mi><mo>⁡</mo><mo>{</mo><mi>d</mi><mo>(</mo><mi>p</mi><mo>,</mo><mi>q</mi><mo>)</mo><mo>|</mo><mi>p</mi><mo>,</mo><mi>q</mi><mo>∈</mo><mi>S</mi><mo>}</mo></math>, is maximized, where <math><mi>d</mi><mo>(</mo><mi>p</mi><mo>,</mo><mi>q</mi><mo>)</mo></math> is the Euclidean distance between two points p and q. The problem is called the max-min k-dispersion problem. In this article, we consider the max-min k-dispersion problem, where a given set P of n points are vertices of a convex polygon. We refer to this variant of the problem as the convex k-dispersion problem.We propose an 1.733-factor approximation algorithm for the convex k-dispersion problem. In addition, we study the convex k-dispersion problem for <math><mi>k</mi><mo>=</mo><mn>4</mn></math>. We propose an iterative algorithm that returns an optimal solution of size 4 in <math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>3</mn></mrow></msup><mo>)</mo></math> time.</div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"187 ","pages":"Article 106498"},"PeriodicalIF":0.5,"publicationDate":"2024-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140843117","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

Regular D-length: A tool for improved prefix-stable forward Ramsey factorisations 常规 D 长度：改进前缀稳定前向拉姆齐因式分解的工具

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2024-04-24 DOI: 10.1016/j.ipl.2024.106497

Théodore Lopez, Benjamin Monmege, Jean-Marc Talbot

引用次数: 0

Correcting matrix products over the ring of integers 修正整数环上的矩阵积

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2024-04-17 DOI: 10.1016/j.ipl.2024.106496

Yu-Lun Wu, Hung-Lung Wang

引用次数: 0

A linear-time algorithm for the center problem in weighted cycle graphs 加权循环图中中心问题的线性时间算法

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2024-04-04 DOI: 10.1016/j.ipl.2024.106495

Taekang Eom , Hee-Kap Ahn

引用次数: 0

The autocorrelation of a class of quaternary sequences of length pq with high complexity 一类长度为 pq 的高复杂度四元序列的自相关性

IF 0.5 4区计算机科学

Information Processing Letters Pub Date : 2024-03-24 DOI: 10.1016/j.ipl.2024.106494

Feifei Yan , Pinhui Ke , Zuling Chang

引用次数: 0

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