Online facility location with weights and congestion
Fuente:
arXiv
Saved in:
| Main Authors: | Chakraborty, Arghya, Vaze, Rahul |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Capacity Provisioning Motivated Online Non-Convex Optimization Problem with Memory and Switching Cost
by: Vaze, Rahul, et al.
Published: (2024)
by: Vaze, Rahul, et al.
Published: (2024)
$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
by: Vaze, Rahul, et al.
Published: (2025)
by: Vaze, Rahul, et al.
Published: (2025)
Scheduling Multi-Server Jobs is Not Easy
by: Vaze, Rahul
Published: (2024)
by: Vaze, Rahul
Published: (2024)
Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint
by: Vaze, Rahul, et al.
Published: (2025)
by: Vaze, Rahul, et al.
Published: (2025)
Online Convex Optimization with Switching Cost with Only One Single Gradient Evaluation
by: Shah, Harsh, et al.
Published: (2025)
by: Shah, Harsh, et al.
Published: (2025)
Spanning tree congestion of proper interval graphs
by: Otachi, Yota
Published: (2026)
by: Otachi, Yota
Published: (2026)
Convex Optimization with Nested Evolving Feasible Sets
by: M., Karthick Krishna, et al.
Published: (2026)
by: M., Karthick Krishna, et al.
Published: (2026)
A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties
by: Xiao, Hanyin, et al.
Published: (2025)
by: Xiao, Hanyin, et al.
Published: (2025)
Optimal Online Bipartite Matching in Degree-2 Graphs
by: Bhangale, Amey, et al.
Published: (2025)
by: Bhangale, Amey, et al.
Published: (2025)
Approximating optimization problems in graphs with locational uncertainty
by: Bougeret, Marin, et al.
Published: (2022)
by: Bougeret, Marin, et al.
Published: (2022)
Equivalence Testing: The Power of Bounded Adaptivity
by: Chakraborty, Diptarka, et al.
Published: (2024)
by: Chakraborty, Diptarka, et al.
Published: (2024)
Constant congestion linkages in polynomially strong digraphs in polynomial time
by: Lopes, Raul, et al.
Published: (2024)
by: Lopes, Raul, et al.
Published: (2024)
Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization
by: Nikolov, Aleksandar, et al.
Published: (2026)
by: Nikolov, Aleksandar, et al.
Published: (2026)
New weighted additive spanners
by: La, An, et al.
Published: (2024)
by: La, An, et al.
Published: (2024)
Edge-weighted Matching in the Dark
by: Huang, Zhiyi, et al.
Published: (2025)
by: Huang, Zhiyi, et al.
Published: (2025)
Range Longest Increasing Subsequence and its Relatives
by: S., Karthik C., et al.
Published: (2024)
by: S., Karthik C., et al.
Published: (2024)
Grandchildren-weight-balanced binary search trees
by: Jugé, Vincent
Published: (2024)
by: Jugé, Vincent
Published: (2024)
Improved girth approximation in weighted undirected graphs
by: Kadria, Avi, et al.
Published: (2025)
by: Kadria, Avi, et al.
Published: (2025)
Improved Online Sorting
by: Nirjhor, Jubayer, et al.
Published: (2025)
by: Nirjhor, Jubayer, et al.
Published: (2025)
Online String Attractors
by: Whittington, Philip
Published: (2024)
by: Whittington, Philip
Published: (2024)
Online Metric TSP
by: Bertram, Christian
Published: (2025)
by: Bertram, Christian
Published: (2025)
Online Unbounded Knapsack
by: Böckenhauer, Hans-Joachim, et al.
Published: (2024)
by: Böckenhauer, Hans-Joachim, et al.
Published: (2024)
Online Monotone Metric Embeddings
by: Coester, Christian, et al.
Published: (2026)
by: Coester, Christian, et al.
Published: (2026)
The Online Submodular Cover Problem
by: Gupta, Anupam, et al.
Published: (2025)
by: Gupta, Anupam, et al.
Published: (2025)
Improved Online Reachability Preservers
by: Bodwin, Greg, et al.
Published: (2024)
by: Bodwin, Greg, et al.
Published: (2024)
Online Knapsack Problems with Estimates
by: Balabán, Jakub, et al.
Published: (2025)
by: Balabán, Jakub, et al.
Published: (2025)
Dependency-Aware Online Caching
by: Dallot, Julien, et al.
Published: (2024)
by: Dallot, Julien, et al.
Published: (2024)
The Online Submodular Assignment Problem
by: Hathcock, Daniel, et al.
Published: (2024)
by: Hathcock, Daniel, et al.
Published: (2024)
Online Firefighting on Cactus Graphs
by: Hugen, Max, et al.
Published: (2025)
by: Hugen, Max, et al.
Published: (2025)
Risk-Sensitive Online Algorithms
by: Christianson, Nicolas, et al.
Published: (2024)
by: Christianson, Nicolas, et al.
Published: (2024)
Online Computation with Untrusted Advice
by: Angelopoulos, Spyros, et al.
Published: (2019)
by: Angelopoulos, Spyros, et al.
Published: (2019)
Online Bisection with Ring Demands
by: Basiak, Mateusz, et al.
Published: (2026)
by: Basiak, Mateusz, et al.
Published: (2026)
Online Facility Assignments on Polygons
by: Malik, Sumaiya, et al.
Published: (2025)
by: Malik, Sumaiya, et al.
Published: (2025)
Online Steiner Forest with Recourse
by: Long, Yaowei, et al.
Published: (2026)
by: Long, Yaowei, et al.
Published: (2026)
The Online Submodular Assignment Problem
by: Hathcock, Daniel, et al.
Published: (2024)
by: Hathcock, Daniel, et al.
Published: (2024)
Competitive Online Transportation Simplified
by: Arndt, Stephen, et al.
Published: (2025)
by: Arndt, Stephen, et al.
Published: (2025)
Online Stochastic Matching with Unknown Arrival Order: Beating $0.5$ against the Online Optimum
by: Sun, Enze, et al.
Published: (2025)
by: Sun, Enze, et al.
Published: (2025)
Online Distributed Queue Length Estimation
by: Bhaskara, Aditya, et al.
Published: (2025)
by: Bhaskara, Aditya, et al.
Published: (2025)
Online Matching: A Brief Survey
by: Huang, Zhiyi, et al.
Published: (2024)
by: Huang, Zhiyi, et al.
Published: (2024)
Homomorphism Testing with Resilience to Online Manipulations
by: Kelman, Esty, et al.
Published: (2025)
by: Kelman, Esty, et al.
Published: (2025)
Similar Items
-
Capacity Provisioning Motivated Online Non-Convex Optimization Problem with Memory and Switching Cost
by: Vaze, Rahul, et al.
Published: (2024) -
$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
by: Vaze, Rahul, et al.
Published: (2025) -
Scheduling Multi-Server Jobs is Not Easy
by: Vaze, Rahul
Published: (2024) -
Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint
by: Vaze, Rahul, et al.
Published: (2025) -
Online Convex Optimization with Switching Cost with Only One Single Gradient Evaluation
by: Shah, Harsh, et al.
Published: (2025)