Sciweavers

AAIM
2010
Springer
155views Algorithms» more  AAIM 2010»
13 years 8 months ago
The (K, k)-Capacitated Spanning Tree Problem
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin
AAIM
2010
Springer
219views Algorithms» more  AAIM 2010»
13 years 8 months ago
Approximating Maximum Edge 2-Coloring in Simple Graphs
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
Zhi-Zhong Chen, Sayuri Konno, Yuki Matsushita
AAIM
2010
Springer
181views Algorithms» more  AAIM 2010»
13 years 8 months ago
Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
Binhai Zhu
AAIM
2010
Springer
165views Algorithms» more  AAIM 2010»
13 years 8 months ago
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...
Christian Ernst, Changxing Dong, Gerold Jäger...
AAIM
2010
Springer
144views Algorithms» more  AAIM 2010»
13 years 9 months ago
Kernelization for Cycle Transversal Problems
Abstract. We present new kernelization results for the s-cycle transversal problem for s > 3. In particular, we show a 6k2 kernel for 4-cycle transversal and a O(ks−1 ) kernel...
Ge Xia, Yong Zhang