📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture (2014)

First Author: Ene A

Attributed to: The Centre for Discrete Mathematics and its Applications (DIMAP) funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.4230/lipics.approx-random.2014.144

Publication URI: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.144

Type: Conference/Paper/Proceeding/Abstract

Volume: 28