pdfformat: 

@InProceedings{ene_et_al:LIPIcs:2014:4694, author = {Alina Ene and Jan Vondr{\'a}k}, title = {{Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {144159}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897743}, ISSN = {18688969}, year = {2014}, volume = {28}, editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and Nikhil R. Devanur and Cristopher Moore}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2014/4694}, URN = {urn:nbn:de:0030drops46943}, doi = {10.4230/LIPIcs.APPROXRANDOM.2014.144}, annote = {Keywords: Minimum Cost Submodular Allocation, Submodular Optimization, Hypergraph Labeling} }
Keywords:  Minimum Cost Submodular Allocation, Submodular Optimization, Hypergraph Labeling  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)  
Issue date:  2014  
Date of publication:  04.09.2014 