The Library
Browse by Funded research at the University of Warwick
Up a level |
Jump to: Conference Item
Number of items: 2.
Conference Item
Ene, Alina and VondrΓ‘k, Jan (2014) Hardness of submodular cost allocation : lattice matching and a simplex coloring conjecture. In: 17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2014), Barcelona, Spain, 4-6 Sep 2014. Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014), Volume 28 pp. 144-159. ISBN 9783939897743. doi:10.4230/LIPIcs.APPROX-RANDOM.2014.144 ISSN 1868-8969.
Ene, Alina and Vakilian, Ali (2014) Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements. In: 46th Annual ACM Symposium on Theory of Computing, New York, USA, 31 May - 3 Jun 2014. Published in: Proceedings of the 46th Annual ACM Symposium on Theory of Computing pp. 754-763. ISBN 9781450327107. doi:10.1145/2591796.2591837