The University of Warwick Library - WebBridge

Hardness of submodular cost allocation : lattice matching and a simplex coloring conjecture
Ene, Alina.  17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2014).  v. Volume 28.   2014. p. 144 - 159... issn: 1868-8969 .   

Online access not found

Sorry - based on the information provided, WebBridge cannot offer appropriate links.