A. Abboud and K. Lewi, Exact Weight Subgraphs and the k-Sum Conjecture
DOI : 10.1007/978-3-642-39206-1_1

F. Barahona and W. R. Pulleyblank, Exact arborescences, matchings and cycles, Discrete Applied Mathematics, vol.16, issue.2, pp.91-99, 1987.
DOI : 10.1016/0166-218X(87)90067-9

N. Halman, G. Nannicini, and J. Orlin, A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs, SIAM Journal on Optimization, vol.25, issue.1, pp.317-350, 2015.
DOI : 10.1137/13094774X

R. Hassin, Approximation Schemes for the Restricted Shortest Path Problem, Mathematics of Operations Research, vol.17, issue.1, pp.36-42, 1992.
DOI : 10.1287/moor.17.1.36

H. C. Joksch, The shortest route problem with constraints, Journal of Mathematical Analysis and Applications, vol.14, issue.2, pp.191-197, 1966.
DOI : 10.1016/0022-247X(66)90020-5

A. V. Karzanov, Maximum matching of given weight in complete and complete bipartite graphs, Cybernetics, vol.23, issue.1, pp.8-13, 1987.
DOI : 10.1007/BF01068796

H. Kellerer and U. Pferschy, A new fully polynomial time approximation scheme for the knapsack problem, Journal of Combinatorial Optimization, vol.3, issue.1, pp.59-71, 1999.
DOI : 10.1023/A:1009813105532

M. Leclerc, Polynomial time algorithms for exact matching problems, 1986.

W. Li and J. Li, Approximation algorithms for $$k$$ -partitioning problems with partition matroid constraint, Optimization Letters, vol.23, issue.3, pp.1093-1099, 2014.
DOI : 10.1007/s11590-013-0637-2

S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, 1990.

M. Milanic and J. Monnot, The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes, Electronic Notes in Discrete Mathematics, vol.35, pp.317-322, 2009.
DOI : 10.1016/j.endm.2009.11.052

T. H. Nguyen, P. Richard, and E. Grolleau, An <sc>fptas</sc> for Response Time Analysis of Fixed Priority Real-Time Tasks with Resource Augmentation, IEEE Transactions on Computers, vol.64, issue.7, pp.1805-1818, 2015.
DOI : 10.1109/TC.2014.2346178

C. H. Papadimitriou and M. Yannakakis, The complexity of restricted spanning tree problems, Journal of the ACM, vol.29, issue.2, pp.285-309, 1982.
DOI : 10.1145/322307.322309

S. Sahni, General Techniques for Combinatorial Approximation, Operations Research, vol.25, issue.6, pp.920-936, 1977.
DOI : 10.1287/opre.25.6.920

S. Sahni and E. Horowitz, Combinatorial Problems: Reductibility and Approximation, Operations Research, vol.26, issue.5, pp.718-759, 1978.
DOI : 10.1287/opre.26.5.718

R. Samanta, A. I. Erzin, S. Raha, Y. V. Shamardin, I. I. Takhonov et al., A provably tight delay-driven concurrently congestion mitigating global routing algorithm, Applied Mathematics and Computation, vol.255, pp.92-104, 2015.
DOI : 10.1016/j.amc.2014.11.062

K. Schemeleva, X. Delorme, A. Dolgui, F. Grimaud, and M. Y. Kovalyov, Lot-sizing on a single imperfect machine: ILP models and FPTAS extensions, Computers & Industrial Engineering, vol.65, issue.4, pp.561-569, 2013.
DOI : 10.1016/j.cie.2013.04.002
URL : https://hal.archives-ouvertes.fr/emse-00881337

V. Vassilevska and R. Williams, Finding, minimizing, and counting weighted subgraphs, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09
DOI : 10.1145/1536414.1536477