arXiv 1402.21372014-02-10cs.DS

Parameterized Directed $k$-Chinese Postman Problem and $k$ Arc-Disjoint Cycles Problem on Euler Digraphs

Gregory Gutin, Mark Jones, Bin Sheng, Magnus Wahlstrom

英文摘要：

In the Directed $k$-Chinese Postman Problem ($k$-DCPP), we are given a connected weighted digraph $G$ and asked to find $k$ non-empty closed directed walks covering all arcs of $G$ such that the total weight of the walks is minimum. Gutin, Muciaccia and Yeo (Theor. Comput. Sci. 513 (2013) 124--128) asked for the parameterized complexity of $k$-DCPP when $k$ is the parameter. We prove that the $k$-DCPP is fixed-parameter tractable. We also consider a related problem of finding $k$ arc-disjoint directed cycles in an Euler digraph, parameterized by $k$. Slivkins (ESA 2003) showed that this problem is W[1]-hard for general digraphs. Generalizing another result by Slivkins, we prove that the problem is fixed-parameter tractable for Euler digraphs. The corresponding problem on vertex-disjoint cycles in Euler digraphs remains W[1]-hard even for Euler digraphs.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Chinese Postman Problem on Edge-Colored Multigraphs

It is well-known that the Chinese postman problem on undirected and directed graphs is polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in sharp contrast to the Chinese postman problem on mixed graphs, i.e., graphs with directed and undirected edges, for which the problem is NP-hard.

2016-09-12cs.DSmath.CO

The Euler and Chinese Postman Problems on 2-Arc-Colored Digraphs

The famous Chinese Postman Problem (CPP) is polynomial time solvable on both undirected and directed graphs. Gutin et al. [Discrete Applied Math 217 (2016)] generalized these results by proving that CPP on $c$-edge-colored graphs is polynomial time solvable for every $c\geq 2$. In CPP on weighted edge-colored graphs $G$, we wish to find a minimum weight properly colored closed walk containing all edges of $G$ (a walk is properly colored if every two consecutive edges are of different color, including the last and first edges in a closed walk). In this paper, we consider CPP on arc-colored digr…

2017-07-20cs.DMcs.DS

An Efficient Algorithm For Chinese Postman Walk on Bi-directed de Bruijn Graphs

Sequence assembly from short reads is an important problem in biology. It is known that solving the sequence assembly problem exactly on a bi-directed de Bruijn graph or a string graph is intractable. However finding a Shortest Double stranded DNA string (SDDNA) containing all the k-long words in the reads seems to be a good heuristic to get close to the original genome. This problem is equivalent to finding a cyclic Chinese Postman (CP) walk on the underlying un-weighted bi-directed de Bruijn graph built from the reads. The Chinese Postman walk Problem (CPP) is solved by reducing it to a gene…

2010-06-24cs.DS

The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable

The Hierarchical Chinese Postman Problem is finding a shortest traversal of all edges of a graph respecting precedence constraints given by a partial order on classes of edges. We show that the special case with connected classes is NP-hard even on orders decomposable into a chain and an incomparable class. For the case with linearly ordered (possibly disconnected) classes, we get 5/3-approximations and fixed-parameter algorithms by transferring results from the Rural Postman Problem.

2021-01-26cs.DMcs.DSmath.OC

Parameterized Complexity of k-Chinese Postman Problem

We consider the following problem called the $k$-Chinese Postman Problem ($k$-CPP): given a connected edge-weighted graph $G$ and integers $p$ and $k$, decide whether there are at least $k$ closed walks such that every edge of $G$ is contained in at least one of them and the total weight of the edges in the walks is at most $p$? The problem $k$-CPP is NP-complete, and van Bevern et al. (to appear) and Sorge (2013) asked whether the $k$-CPP is fixed-parameter tractable when parameterized by $k$. We prove that the $k$-CPP is indeed fixed-parameter tractable. In fact, we prove a stronger result: …

2013-11-22cs.CCcs.DS

Parameterized Complexity of the $k$-Arc Chinese Postman Problem

In the Mixed Chinese Postman Problem (MCPP), given an edge-weighted mixed graph $G$ ($G$ may have both edges and arcs), our aim is to find a minimum weight closed walk traversing each edge and arc at least once. The MCPP parameterized by the number of edges was known to be fixed-parameter tractable using a simple argument. Solving an open question of van Bevern et al., we prove that the MCPP parameterized by the number of arcs is also fixed-parameter tractable. Our proof is more involved and, in particular, uses a well-known result of Marx, O'Sullivan and Razgon (2013) on the treewidth of tors…

2016-09-12cs.CCcs.DS

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

Structural Parameterizations of the Mixed Chinese Postman Problem

In the Mixed Chinese Postman Problem (MCPP), given a weighted mixed graph $G$ ($G$ may have both edges and arcs), our aim is to find a minimum weight closed walk traversing each edge and arc at least once. The MCPP parameterized by the number of edges in $G$ or the number of arcs in $G$ is fixed-parameter tractable as proved by van Bevern {\em et al.} (in press) and Gutin, Jones and Sheng (ESA 2014), respectively. In this paper, we consider the unweighted version of MCPP. Solving an open question of van Bevern {\em et al.} (in press), we show that somewhat unexpectedly MCPP parameterized by th…

2015-01-25cs.CCcs.DS

从中国邮递员问题到旅行商问题及延伸 I：近似求解δ覆盖所有边上所有点的最短回路（Shortest Tours $\delta$-Covering All Points on All Edges）。本文研究由Dearing和Francis于1974年在《Transportation Science》上提出的经典连续图模型，该模型将每条边视为由点组成的连续单位长度区间。针对$\delta\geq 0$的情况，我们提出了$\delta$-Tour问题，目标是找到能与每条边上的每个点的距离都不超过$\delta$的最短回路。经分析可知，0-Tour问题本质上等价于中国邮递员问题，可在多项式时间内求解；与之相对，1/2-Tour问题本质上等价于图旅行商问题（Graphic Traveling Salesman Problem, TSP），属于NP难问题，但存在多项式时间的常数因子近似算法。我们探究了$\delta$取其他值时的$\delta$-Tour问题，发现该问题的特性及分析所需的思路在不同$\delta$取值区间内存在显著差异。我们设计了多项式时间近似算法，具体结果如下：(1) 对任意固定的$0 < \delta< 3/2$，$\delta$-Tour问题存在常数因子近似算法；(2) 对任意固定的$\delta\geq 3/2$，该问题存在$O(\log{n})$近似算法；(3) 若$\delta$作为输入的一部分，则该问题存在$O(\n^3)$近似算法。本文是关于$\delta$-Tour问题的两篇论文中的第一篇，第二篇将补充本文提出的近似算法的不可近似性结果及参数化复杂度相关研究。

From Chinese Postman to Salesman and Beyond I: Approximating Shortest Tours $δ$-Covering All Points on All Edges

本文提出δ覆盖所有边上点的最短回路δ-Tour问题，针对不同δ取值区间设计了多项式时间近似算法，是该问题系列研究的第一篇。

2025-02-24cs.CCcs.DS

从中国邮递员到推销员及其超越II：不可近似性与参数化复杂性

From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity

本文研究连续图模型中的$δ$-Tour问题，证明了对于$δ<3/2$的APX难性和FPT性，对于$δ\geq3/2$的强不可近似性和W[2]难性，并给出了$δ$作为输入时的精确算法及其基于ETH的下界。

2025-02-25cs.CCcs.DS

Solving Routing Problems via Important Cuts

We introduce a novel approach of using important cuts which allowed us to design significantly faster fixed-parameter tractable (FPT) algorithms for the following routing problems: the Mixed Chinese Postman Problem parameterized by the number of directed edges (Gutin et al., JCSS 2017), the Minimum Shared Edges problem (MSE) parameterized by the number p of paths between two specified vertices (Fluschnik et al., JCSS 2019), and the Weighted Min Cut Prevention problem (Gruttemeier et al., WG 2021). The Minimum Vulnerability problem (MV) is a generalization of MSE (Assadi et al., Algorithmica 20…

2022-06-08cs.DS