Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference33 articles.
1. C. Ambühl, M. Mastrolilli, O. Svensson, Approximating precedence-constrained single machine scheduling by coloring, in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28–30 2006, Proceedings, 2006, pp. 15–26.
2. The permutahedron of N-sparse posets;von Arnim;Math. Program.,1996
3. Linear-time computation of optimal subgraphs of decomposable graphs;Bern;J. Algorithms,1987
4. A. Billstein, R. Schrader, A note on integral generalized flows in generalized series-parallel digraphs, Manuscript, 2019, submitted for publication.
5. Solving problems on recursively constructed graphs;Borie;ACM Comput. Surv.,2009