On approximating four covering and packing problems-Reference-Cited by-同舟云学术

On approximating four covering and packing problems

Published:2009-08 Issue:5 Volume:75 Page:287-302
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Ashley Mary,Berger-Wolf Tanya,Berman Piotr,Chaovalitwongse Wanpracha,DasGupta Bhaskar,Kao Ming-Yang

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference39 articles.

1. A simulated annealing algorithm for maximum likelihood pedigree reconstruction;Almudevar;Theoret. Population Biol.,2003

2. Estimation of single generation sibling relationships based on DNA markers;Almudevar;J. Agric. Biol. Environ. Stat.,1999

3. Derandomized graph products;Alon;Comput. Complexity,1995

4. M.V. Ashley, I.C. Caballero, W. Chaovalitwongse, B. DasGupta, P. Govindan, S. Sheikh, T.Y. Berger-Wolf, KINALYZER, A Computer Program for Reconstructing Sibling Groups, Molecular Ecology Resources, in press

5. Genome rearrangements and sorting by reversals;Bafna;SIAM J. Comput.,1996

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Branch-and-bound algorithm for the maximum triangle packing problem;Computers & Industrial Engineering;2015-03

2. New Optimization Model and Algorithm for Sibling Reconstruction from Genetic Markers;INFORMS Journal on Computing;2010-05

3. COMBINATORIAL RECONSTRUCTION OF HALF-SIBLING GROUPS FROM MICROSATELLITE DATA;Journal of Bioinformatics and Computational Biology;2010-04

4. AN IMPLICIT COVER PROBLEM IN WILD POPULATION STUDY;Discrete Mathematics, Algorithms and Applications;2010-03

5. Discovering Kinship through Small Subsets;Lecture Notes in Computer Science;2010