Parameterized lower bounds for the weighted vertex cover problem in trees

IF 0.5 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Acta Informatica Pub Date : 2025-08-30 DOI:10.1007/s00236-025-00498-8

P. Wojciechowski, K. Subramani

引用次数: 0

Abstract

In this paper, we analyze the weighted partial vertex cover problem on undirected, vertex-weighted, edge-weighted trees (WPVCT). This problem has been studied in the literature from the perspectives of exact and approximation algorithms. We investigate this problem from the perspectives of parameterization and kernelization. The WPVCT problem finds applications in a number of domains including communications, logistics and data science. This problem is defined by a number of parameters (input, output and structural). We focus on the number of vertices in the optimal cover as the parameter of interest (output parameter). One of our results is a lower bound for parameterized algorithms for the WPVCT problem. A second result is a lower bound on the number of bits in a kernel for the same problem. Both these results are based on the Exponential Time Hypothesis (ETH).

Abstract Image

查看原文本刊更多论文

树中加权顶点覆盖问题的参数化下界

本文研究了无向、顶点加权、边加权树（WPVCT）上的加权部分顶点覆盖问题。这个问题在文献中已经从精确和近似算法的角度进行了研究。我们从参数化和核化的角度来研究这个问题。WPVCT问题在许多领域都有应用，包括通信、物流和数据科学。这个问题由许多参数（输入、输出和结构）定义。我们将最优覆盖中的顶点数量作为感兴趣的参数（输出参数）。我们的结果之一是WPVCT问题的参数化算法的下界。第二个结果是同一个问题的核中位数的下界。这两个结果都是基于指数时间假设（ETH）。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Acta Informatica 工程技术-计算机：信息系统

CiteScore

2.40

自引率

16.70%

发文量

审稿时长

>12 weeks

期刊介绍： Acta Informatica provides international dissemination of articles on formal methods for the design and analysis of programs, computing systems and information structures, as well as related fields of Theoretical Computer Science such as Automata Theory, Logic in Computer Science, and Algorithmics. Topics of interest include: • semantics of programming languages • models and modeling languages for concurrent, distributed, reactive and mobile systems • models and modeling languages for timed, hybrid and probabilistic systems • specification, program analysis and verification • model checking and theorem proving • modal, temporal, first- and higher-order logics, and their variants • constraint logic, SAT/SMT-solving techniques • theoretical aspects of databases, semi-structured data and finite model theory • theoretical aspects of artificial intelligence, knowledge representation, description logic • automata theory, formal languages, term and graph rewriting • game-based models, synthesis • type theory, typed calculi • algebraic, coalgebraic and categorical methods • formal aspects of performance, dependability and reliability analysis • foundations of information and network security • parallel, distributed and randomized algorithms • design and analysis of algorithms • foundations of network and communication protocols.