Maher, M. Cyrus Uricchio, Lawrence H. Torgerson, Dara G. Hernandez, Ryan D.
Published in
Human Heredity

Objectives: Identifying drivers of complex traits from the noisy signals of genetic variation obtained from high-throughput genome sequencing technologies is a central challenge faced by human geneticists today. We hypothesize that the variants involved in complex diseases are likely to exhibit non-neutral evolutionary signatures. Uncovering the ev...

Gribanov, D. V. Malyshev, D. S. Pardalos, P. M. Veselov, S. I.
Published in
Journal of Combinatorial Optimization

In this paper, we present fixed-parameter tractable algorithms for special cases of the shortest lattice vector, integer linear programming, and simplex width computation problems, when matrices included in the problems’ formulations are near square. The parameter is the maximum absolute value of the rank minors in the corresponding matrices. Addit...

Cao, Yixin Chen, Jianer
Published in
Journal of Combinatorial Optimization

Barketau, Maksim
Published in
Journal of Combinatorial Optimization

The following problem is considered. We are given a vector space that can be the vector space Rm\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {R}^m$$\end{docu...

Brimkov, Boris Mikesell, Derek Smith, Logan
Published in
Journal of Combinatorial Optimization

The study of power domination in graphs arises from the problem of placing a minimum number of measurement devices in an electrical network while monitoring the entire network. A power dominating set of a graph is a set of vertices from which every vertex in the graph can be observed, following a set of rules for power system monitoring. In this pa...

Luo, Song Matsuura, Yuji Miao, Ying Shigeno, Maiko
Published in
Journal of Combinatorial Optimization

Group testing refers to any procedure which groups arbitrary subsets of items into pools, and then tests each pool to identify the “sparse” defective items. This paper focuses on a probing scheme in non-adaptive group testing with graph-based constraints. Assume that all nodes function properly but there is at most one failed edge in an undirected ...

Li, Xueliang Xia, Wen
Published in
Journal of Combinatorial Optimization

An oriented graph Gσ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G^\sigma $$\end{document} is a digraph which is obtained by orienting every edge of a simple graph G...

Shiri, Davood Salman, F. Sibel
Published in
Journal of Combinatorial Optimization

We consider the online k-Canadian Traveler Problem (k-CTP) which is defined on an undirected graph with a given source node O and a destination node D. Non-negative edge costs are given. The traveling agent is initially at O. There are k blocked edges in the graph, but these edges are not known to the agent. A blocked edge is learned when the agent...

Pinson, Nicolas Spieksma, Frits C. R.
Published in
Journal of Combinatorial Optimization

We consider an online interval scheduling problem on two related machines. If one machine is at least as twice as fast as the other machine, we say the machines are distinct; otherwise the machines are said to be similar. Each job j∈J\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \...

Zhu, Jianming Liu, Shuyue Ghosh, Smita
Published in
Journal of Combinatorial Optimization

Emergency relief distribution plays a vital role during disaster responding. This paper studies routes selection and transportation time moment selection for emergency relief distribution along with disaster information updating. This paper derives a new definition for route reliability, which is a combination of multiple routes according to three ...