Yingli Ran
YOU?
Author Swipe
View article: Degree Realization by Bipartite Cactus Graphs
Degree Realization by Bipartite Cactus Graphs Open
The \textsc{Degree Realization} problem with respect to a graph family $\mathcal{F}$ is defined as follows. The input is a sequence $d$ of $n$ positive integers, and the goal is to decide whether there exists a graph $G \in \mathcal{F}$ wh…
View article: Approximate Realizations for Outerplanaric Degree Sequences
Approximate Realizations for Outerplanaric Degree Sequences Open
We study the question of whether a sequence d = (d_1,d_2, \ldots, d_n) of positive integers is the degree sequence of some outerplanar (a.k.a. 1-page book embeddable) graph G. If so, G is an outerplanar realization of d and d is an outerpl…
View article: A New Approximation Algorithm for Minimum-Weight $(1,m)$--Connected Dominating Set
A New Approximation Algorithm for Minimum-Weight $(1,m)$--Connected Dominating Set Open
Consider a graph with nonnegative node weight. A vertex subset is called a CDS (connected dominating set) if every other node has at least one neighbor in the subset and the subset induces a connected subgraph. Furthermore, if every other …
View article: Approximation Algorithm for Minimum $p$ Union Under a Geometric Setting
Approximation Algorithm for Minimum $p$ Union Under a Geometric Setting Open
In a minimum $p$ union problem (Min$p$U), given a hypergraph $G=(V,E)$ and an integer $p$, the goal is to find a set of $p$ hyperedges $E'\subseteq E$ such that the number of vertices covered by $E'$ (that is $|\bigcup_{e\in E'}e|$) is min…
View article: A parallel algorithm for minimum weight set cover with small neighborhood property
A parallel algorithm for minimum weight set cover with small neighborhood property Open
This paper studies the minimum weight set cover (MinWSC) problem with a {\em small neighborhood cover} (SNC) property proposed by Agarwal {\it et al.} in \cite{Agarwal.}. A parallel algorithm for MinWSC with $τ$-SNC property is presented, …
View article: Performance Guaranteed Evolutionary Algorithm for Minimum Connected Dominating Set
Performance Guaranteed Evolutionary Algorithm for Minimum Connected Dominating Set Open
A connected dominating set is a widely adopted model for the virtual backbone of a wireless sensor network. In this paper, we design an evolutionary algorithm for the minimum connected dominating set problem (MinCDS), whose performance is …
View article: Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem
Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem Open
In the minimum cost submodular cover problem (MinSMC), we are given a monotone nondecreasing submodular function $f\colon 2^V \rightarrow \mathbb{Z}^+$, a linear cost function $c: V\rightarrow \mathbb R^{+}$, and an integer $k\leq f(V)$, t…
View article: A Parallel Algorithm for Minimum Cost Submodular Cover.
A Parallel Algorithm for Minimum Cost Submodular Cover. Open
In a minimum cost submodular cover problem (MinSMC), given a monotone non-decreasing submodular function $f\colon 2^V \rightarrow \mathbb{Z}^+$, a cost function $c: V\rightarrow \mathbb R^{+}$, an integer $k\leq f(V)$, the goal is to find …