List Supermodular Coloring

[1]  Tamás Fleiner,et al.  On Weighted Kernels of Two Posets , 2016, Order.

[2]  Yin Tat Lee,et al.  A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[3]  M. Aigner,et al.  Proofs from "The Book" , 2001 .

[4]  James B. Orlin,et al.  A faster strongly polynomial time algorithm for submodular function minimization , 2007, Math. Program..

[5]  Alexander Schrijver,et al.  A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.

[6]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[7]  Fred Galvin,et al.  The List Chromatic Index of a Bipartite Multigraph , 1995, J. Comb. Theory, Ser. B.

[8]  András Frank,et al.  Generalized polymatroids and submodular flows , 1988, Math. Program..

[9]  Norbert Sauer,et al.  On monochromatic paths in edge-coloured digraphs , 1982, J. Comb. Theory, Ser. B.

[10]  András Frank,et al.  A Survey on Covering Supermodular Functions , 2009, Bonn Workshop of Combinatorial Optimization.

[11]  L. Shapley,et al.  College Admissions and the Stability of Marriage , 1962 .

[12]  Tamás Fleiner,et al.  A Fixed-Point Approach to Stable Matchings and Some Applications , 2003, Math. Oper. Res..

[13]  Satoru Iwata,et al.  A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.

[14]  András Frank,et al.  Characterizing and recognizing generalized polymatroids , 2013, Mathematical Programming.

[15]  Ram Prakash Gupta.  An edge-coloration theorem for bipartite graphs with applications , 1978, Discret. Math..