Showing 1–20 of 49 results
/ Date/ Name
Oct 19, 2011Min-Max Graph Partitioning and Small Set ExpansionMar 15, 2018Approximating Max-Cut under Graph-MSO ConstraintsDec 3, 2021On Some Variants of Euclidean K-SupplierJun 30, 2021The Power of Adaptivity for Stochastic Submodular CoverMar 25, 2014Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient RoutingJan 29, 2025Sequential Testing with Subadditive CostsMar 3, 2010Approximation Algorithms for Optimal Decision Trees and Adaptive TSP ProblemsJul 4, 2007Dial a Ride from k-forestMar 4, 2011Locating Depots for Capacitated Vehicle RoutingFeb 24, 2013A Stochastic Probing Problem with ApplicationsNov 14, 2013On the Adaptivity Gap of Stochastic OrienteeringJun 5, 2016Adaptive Submodular Ranking and RoutingAug 31, 2010When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic MatchingsNov 21, 2023Informative Path Planning with Limited AdaptivityFeb 22, 2022Batched Dueling BanditsDec 5, 2018Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design ProblemsFeb 25, 2020Stochastic Makespan Minimization in Structured Set SystemsNov 10, 2021Non-Adaptive Stochastic Score Classification and Explainable Halfspace EvaluationAug 2, 2016Adaptivity Gaps for Stochastic Probing: Submodular and XOS FunctionsMay 23, 2024Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover