S. Arora, L. Babai, J. Stern, and Z. Sweedyk, The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations, Journal of Computer and System Sciences, vol.54, issue.2, pp.317-331, 1997.
DOI : 10.1006/jcss.1997.1472

A. Bar-noy, R. Bar-yehuda, A. Freund, J. Naor, and B. Schieber, A unified approach to approximating resource allocation and scheduling, Journal of the ACM, vol.48, issue.5, pp.1069-1090, 2001.
DOI : 10.1145/502102.502107

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.3987

P. Berman and M. Karpinski, On some tighter inapproximability results, Proc. of ICALP, pp.200-209, 1999.

S. Canzar, K. Elbassioni, G. W. Klau, and J. Mestre, On tree-constrained matchings and generalizations, Proc. 38th International Colloquium on Automata, Languages and Programming Lecture Notes in Computer Science, 2011.
DOI : 10.1007/978-3-642-22006-7_9

URL : https://hal.archives-ouvertes.fr/hal-01248542

U. Feige and L. Lovász, Two-prover one-round proof systems, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing , STOC '92, pp.733-744, 1992.
DOI : 10.1145/129712.129783

M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, 1988.

E. Hazan, S. Safra, and O. Schwartz, On the Complexity of Approximating k-Dimensional Matching, Proc. of RANDOM, pp.83-97, 2003.
DOI : 10.1007/978-3-540-45198-3_8

M. Hoefer, T. Kesselheim, and B. Vöcking, Approximation algorithms for secondary spectrum auctions. CoRR, abs/1007, 2010.
DOI : 10.1145/1989493.1989520

URL : http://arxiv.org/abs/1007.5032

G. Kortsarz, On the Hardness of Approximating Spanners, Algorithmica, vol.30, issue.3, pp.432-450, 2001.
DOI : 10.1007/s00453-001-0021-y

A. Mosig, S. Jäger, C. Wang, S. Nath, I. Ersoy et al., Tracking cells in Life Cell Imaging videos using topological alignments, Algorithms for Molecular Biology, vol.4, issue.1, p.10, 2009.
DOI : 10.1186/1748-7188-4-10

URL : http://doi.org/10.1186/1748-7188-4-10

L. A. Wolsey and G. L. Nemhauser, Integer and Combinatorial Optimization, 1999.

H. Xiao, Y. Li, J. Du, and A. Mosig, Ct3d: tracking microglia motility in 3D using a novel cosegmentation approach, Bioinformatics, vol.27, issue.4, pp.564-571, 2011.
DOI : 10.1093/bioinformatics/btq691

F. Yang, M. A. Mackey, F. Ianzini, G. Gallardo, and M. Sonka, Cell Segmentation, Tracking, and Mitosis Detection Using Temporal Context, Proc. of MICCAI, pp.302-309, 2005.
DOI : 10.1007/11566465_38

C. Zimmer, B. Zhang, A. Dufour, A. Thebaud, S. Berlemont et al., On the digital trail of mobile cells, IEEE Signal Processing Magazine, vol.23, issue.3, pp.54-62, 2006.
DOI : 10.1109/MSP.2006.1628878