arXiv 1503.080782015-03-27cs.DS

Parameterized Complexity of Asynchronous Border Minimization

Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa

英文摘要：

Microarrays are research tools used in gene discovery as well as disease and cancer diagnostics. Two prominent but challenging problems related to microarrays are the Border Minimization Problem (BMP) and the Border Minimization Problem with given placement (P-BMP). In this paper we investigate the parameterized complexity of natural variants of BMP and P-BMP under several natural parameters. We show that BMP and P-BMP are in FPT under the following two combinations of parameters: 1) the size of the alphabet (c), the maximum length of a sequence (string) in the input (l) and the number of rows of the microarray (r); and, 2) the size of the alphabet and the size of the border length (o). Furthermore, P-BMP is in FPT when parameterized by c and l. We complement our tractability results with corresponding hardness results.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Hardness and Approximation of The Asynchronous Border Minimization Problem

We study a combinatorial problem arising from microarrays synthesis. The synthesis is done by a light-directed chemical process. The objective is to minimize unintended illumination that may contaminate the quality of experiments. Unintended illumination is measured by a notion called border length and the problem is called Border Minimization Problem (BMP). The objective of the BMP is to place a set of probe sequences in the array and find an embedding (deposition of nucleotides/residues to the array cells) such that the sum of border length is minimized. A variant of the problem, called P-BM…

2010-11-04cs.DS

Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems

Scheduling theory is an old and well-established area in combinatorial optimization, whereas the much younger area of parameterized complexity has only recently gained the attention of the community. Our aim is to bring these two areas closer together by studying the parameterized complexity of a class of single-machine two-agent scheduling problems. Our analysis focuses on the case where the number of jobs belonging to the second agent is considerably smaller than the number of jobs belonging to the first agent, and thus can be considered as a fixed parameter k. We study a variety of combinat…

2017-09-13cs.DS

计算MAD树的参数化算法

Parameterized Algorithms for Computing MAD Trees

本文研究了MAD树问题的参数化复杂性，提出了基于模宽和树宽的线性时间与多项式时间算法，并证明了其在顶点完整性或保证参数下的FPT性质，同时证明在分割图上为NP难。

2026-03-31cs.DS

时间痛苦值的参数化复杂度

Parameterized Complexity of Temporal Agony

Technische Universität Berlin（柏林工业大学）

针对时间网络层级发现的Seg-Agony问题，研究其参数化复杂度，明确了不同等级数、惩罚值等参数下的复杂度边界与可解性结果。

2026-08-21cs.DS

Parameterized Verification of Algorithms for Oblivious Robots on a Ring

IRIF - Univ Paris Diderot（巴黎狄德罗大学 IRIF）；Sorbonne Universités, UPMC Univ Paris 06（索邦大学皮埃尔和玛丽·居里大学）

We study verification problems for autonomous swarms of mobile robots that self-organize and cooperate to solve global objectives. In particular, we focus in this paper on the model proposed by Suzuki and Yamashita of anonymous robots evolving in a discrete space with a finite number of locations (here, a ring). A large number of algorithms have been proposed working for rings whose size is not a priori fixed and can be hence considered as a parameter. Handmade correctness proofs of these algorithms have been shown to be error-prone, and recent attention had been given to the application of fo…

2017-06-16cs.CCcs.DCcs.DS

Parameterized Complexity of Directed Steiner Tree on Sparse Graphs

We study the parameterized complexity of the directed variant of the classical {\sc Steiner Tree} problem on various classes of directed sparse graphs. While the parameterized complexity of {\sc Steiner Tree} parameterized by the number of terminals is well understood, not much is known about the parameterization by the number of non-terminals in the solution tree. All that is known for this parameterization is that both the directed and the undirected versions are W[2]-hard on general graphs, and hence unlikely to be fixed parameter tractable FPT. The undirected {\sc Steiner Tree} problem bec…

2012-10-01cs.DMcs.DS

更多相关论文收起更多论文

Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees

Vertex Cover parameterized by the solution size k is the quintessential fixed-parameter tractable problem. FPT algorithms are most interesting when the parameter is small. Several lower bounds on k are well-known, such as the maximum size of a matching. This has led to a line of research on parameterizations of Vertex Cover by the difference of the solution size k and a lower bound. The most prominent cases for such lower bounds for which the problem is FPT are the matching number or the optimal fractional LP solution. We investigate parameterizations by the difference between k and other grap…

2022-08-19cs.CCcs.DS

参数化最大节点不相交路径

Parameterized Maximum Node-Disjoint Paths

研究 Maximum Node-Disjoint Paths 问题的参数化近似，提出基于 color-coding 的 FPT 近似方案解决 tree-depth 参数，并证明 pathwidth 下不可近似，精确界定参数边界。

2025-09-17cs.CCcs.DS

Disentangling the Computational Complexity of Network Untangling

Technische Universität Berlin（柏林工业大学）

We study the network untangling problem introduced by Rozenshtein, Tatti, and Gionis [DMKD 2021], which is a variant of Vertex Cover on temporal graphs -- graphs whose edge set changes over discrete time steps. They introduce two problem variants. The goal is to select at most $k$ time intervals for each vertex such that all time-edges are covered and (depending on the problem variant) either the maximum interval length or the total sum of interval lengths is minimized. This problem has data mining applications in finding activity timelines that explain the interactions of entities in complex …

2022-04-06cs.AIcs.DMcs.DS

Complexity of Token Swapping and its Variants

In the Token Swapping problem we are given a graph with a token placed on each vertex. Each token has exactly one destination vertex, and we try to move all the tokens to their destinations, using the minimum number of swaps, i.e., operations of exchanging the tokens on two adjacent vertices. As the main result of this paper, we show that Token Swapping is $W[1]$-hard parameterized by the length $k$ of a shortest sequence of swaps. In fact, we prove that, for any computable function $f$, it cannot be solved in time $f(k)n^{o(k / \log k)}$ where $n$ is the number of vertices of the input graph,…

2018-01-05cs.CCcs.DMcs.DS