Fetching the paper…
Reading the bibliography…
Optimization problems often involve vector norms, which has led to extensive research on developing algorithms that can handle objectives beyond the $\ell_p$ norms.
Matrix Analysis
Rajendra Bhatia · 1997
Earlier work this paper cites.
Online facility location
Adam Meyerson · 2001
Earlier work this paper cites.
Combinatorial optimization: polyhedra and efficiency
Alexander Schrijver · 2003
Earlier work this paper cites.
Submodular functions and optimization
Satoru Fujishige · 2005
Earlier work this paper cites.
On the competitive ratio for online facility location
Dimitris Fotakis · 2008
Earlier work this paper cites.
Structured sparsity-inducing norms through submodular functions
Francis R. Bach · 2010
Earlier work this paper cites.
Facility location with hierarchical facility costs
Zoya Svitkina and ÉVA Tardos · 2010
Earlier work this paper cites.
Online primal-dual for non-linear optimization with applications to speed scaling
Anupam Gupta, Ravishankar Krishnaswamy, and Kirk Pruhs · 2012
Earlier work this paper cites.
Learning with submodular functions: A convex optimization perspective
Francis R. Bach · 2013
Earlier work this paper cites.
A stochastic probing problem with applications
Anupam Gupta and Viswanath Nagarajan · 2013
Earlier work this paper cites.
Online algorithms for covering and packing problems with convex objectives
Yossi Azar, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang, Ning Kang, Viswanath Nagarajan, Joseph Naor, and Debmalya Panigrahi · 2016
Earlier work this paper cites.
Maximizing stochastic monotone submodular functions
Arash Asadpour and Hamid Nazerzadeh · 2016
Earlier work this paper cites.
Algorithms and adaptivity gaps for stochastic probing
Anupam Gupta, Viswanath Nagarajan, and Sahil Singla · 2016
Earlier work this paper cites.
Approximate near neighbors for general symmetric norms
Alexandr Andoni, Huy L. Nguyen, Aleksandar Nikolov, Ilya P. Razenshteyn, and Erik Waingarten · 2017
Earlier work this paper cites.
Adaptivity gaps for stochastic probing: Submodular and XOS functions
Anupam Gupta, Viswanath Nagarajan, and Sahil Singla · 2017
Cited alongside, same era.
Subspace embedding and linear regression with orlicz norm
Alexandr Andoni, Chengyu Lin, Ying Sheng, Peilin Zhong, and Ruiqi Zhong · 2018
Cited alongside, same era.
Hölder homeomorphisms and approximate nearest neighbors
Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, and Erik Waingarten · 2018
Cited alongside, same era.
Submodular Functions: from Discrete to Continous Domains
Francis Bach · 2018
Cited alongside, same era.
Constant-factor approximation for ordered k-median
Jaroslaw Byrka, Krzysztof Sornat, and Joachim Spoerhase · 2018
Cited alongside, same era.
Optimal algorithms for continuous non-monotone submodular and dr-submodular maximization
Rad Niazadeh, Tim Roughgarden, and Joshua R. Wang · 2018
Continuous submodular maximization: Beyond dr-submodularity
Moran Feldman and Amin Karbasi · 2020
Later among the works it cites.
Approximation algorithms for stochastic minimum-norm combinatorial optimization
Sharat Ibrahimpur and Chaitanya Swamy · 2020
Later among the works it cites.
Online learning with vector costs and bandits with knapsacks
Thomas Kesselheim and Sahil Singla · 2020
Later among the works it cites.
Adaptivity in adaptive submodularity
Hossein Esfandiari, Amin Karbasi, and Vahab S. Mirrokni · 2021
Later among the works it cites.
Minimum-norm load balancing is (almost) as easy as minimizing makespan
Sharat Ibrahimpur and Chaitanya Swamy · 2021
Later among the works it cites.
Stochastic minimum norm combinatorial optimization
Sharat Ibrahimpur · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Optimal continuous dr-submodular maximization and applications to provable mean field inference
Yatao An Bian, Joachim M. Buhmann, and Andreas Krause · 2019
Cited alongside, same era.
(Near) optimal adaptivity gaps for stochastic multi-value probing
Domagoj Bradac, Sahil Singla, and Goran Zuzic · 2019
Cited alongside, same era.
Approximation algorithms for minimum norm and ordered optimization problems
Deeparnab Chakrabarty and Chaitanya Swamy · 2019
Cited alongside, same era.
Simpler and better algorithms for minimum-norm load balancing
Deeparnab Chakrabarty and Chaitanya Swamy · 2019
Cited alongside, same era.
On mean estimation for general norms with statistical queries
Jerry Li, Aleksandar Nikolov, Ilya P. Razenshteyn, and Erik Waingarten · 2019
Cited alongside, same era.
Efficient symmetric norm regression via linear sketching
Zhao Song, Ruosong Wang, Lin F. Yang, Hongyang Zhang, and Peilin Zhong · 2019
Cited alongside, same era.
A simple approximation algorithm for vector scheduling and applications to stochastic min-norm load balancing
Sharat Ibrahimpur and Chaitanya Swamy · 2022
Later among the works it cites.
Stochastic continuous submodular maximization: Boosting via non-oblivious function
Qixin Zhang, Zengde Deng, Zaiyi Chen, Haoyuan Hu, and Yu Yang · 2022
Later among the works it cites.
Communication complexity of inner product in symmetric normed spaces
Alexandr Andoni, Jaroslaw Blasiok, and Arnold Filtser · 2023
Closest in time.
Generalized unrelated machine scheduling problem
Shichuan Deng, Jian Li, and Yuval Rabani · 2023
Closest in time.
Generalized unrelated machine scheduling problem
Shichuan Deng, Jian Li, and Yuval Rabani · 2023
Closest in time.
Socially fair and hierarchical facility location problems
Swati Gupta, Jai Moondra, and Mohit Singh · 2023
Closest in time.
Online and bandit algorithms beyond
Thomas Kesselheim, Marco Molinaro, and Sahil Singla · 2023
Closest in time.