Title
Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture.
Year
Venue
Field
2014
APPROX-RANDOM
Set cover problem,Discrete mathematics,Combinatorics,Multiplicative function,Lattice (order),Submodular set function,Simplex,Partition (number theory),Conjecture,Mathematics,Monotone polygon
DocType
Citations 
PageRank 
Conference
1
0.37
References 
Authors
13
2
Name
Order
Citations
PageRank
Alina Ene140925.47
Jan Vondrák288847.94