B. Sheng

activity

20142022

most citedParameterized Complexity of the

k

-Arc Chinese Postman Problem

7 citations · 20 across the 13 of their papers we have counts for

collaborators

Showing 2014Show all

3 papers · 1 filter

cs.DS2014

Parameterized and Approximation Algorithms for the Load Coloring Problem

F. Barbero, G. Gutin, M. Jones +1

Let $c, k$ be two positive integers and let $G = (V, E)$ be a graph. The $(c, k)$ -Load Coloring Problem (denoted $(c, k)$ -LCP) asks whether there is a $c$ -coloring $φ: V \rightarrow [c]…

cs.DS2014★ 7 cited

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

Gregory Gutin, Mark Jones, Bin Sheng

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 e…

cs.DS2014★ 1 cited

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

Gregory Gutin, Mark Jones, Bin Sheng +1

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$ …

Parameterized and Approximation Algorithms for the Load Coloring Problem

Parameterized Complexity of the k-Arc Chinese Postman Problem

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

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

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