We prove that the problem is APX-hard and present a 2k- 1-approximation algorithm for the case in which each genotype has at most k ambiguous positions.Expand

We show that the firefighter problem is NP-complete for trees of maximum degree three, but in polynomial time if the fire breaks out at a vertex of degree at most two.Expand

Cycles in graphs play an important role in many applications, e.g., analysis of electrical networks, analysis of chemical and biological pathways, periodic scheduling, and graph drawing.Expand

We study the complexity and approximability of CYCLE PACKING, about which very little is known although the problem is natural and has practical applications.Expand

We proposed a novel radically different method based on minimum-cost network flows for a multiassembly problem arising from isoform identification and quantification with RNA-Seq.Expand

We adapt the greedy approach proposed by Horton [A polynomial-time algorithm to find the shortest cycle basis of a graph, SIAM J. Sci. 16 (1987) 358] and hereby obtain a very simple exact algorithm of complexity O(m4n), being as fast as the first algorithm proposed for this problem.Expand

The problem of data broadcasting over multiple channels is considered, assuming skewed data allocation to channels and flat data scheduling per channel, with the objective of minimizing the average waiting time.Expand