No. Title Author Year
1 A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint Ene, Alina et al. 2019
2 Towards Nearly-Linear Time Algorithms for Submodular Maximization with a Matroid Constraint Ene, Alina et al. 2019
3 Approximation Algorithms for Stochastic k-TSP Ene, Alina et al. 2018
4 Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs Chekuri, Chandra et al. 2016
5 On Routing Disjoint Paths in Bounded Treewidth Graphs Ene, Alina et al. 2016
6 Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture Ene, Alina et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 6


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI