Dynamic Curing and Network Design in SIS Epidemic Processes
Fuente:
arXiv
Saved in:
| Main Authors: | Yi, Yuhao, Shan, Liren, Wang, Shijie, Paré, Philip E., Johansson, Karl H. |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Polyamorous Scheduling
by: Gąsieniec, Leszek, et al.
Published: (2024)
by: Gąsieniec, Leszek, et al.
Published: (2024)
Parameterized Complexity of Scheduling Problems in Robotic Process Automation
by: Dvořák, Michal, et al.
Published: (2026)
by: Dvořák, Michal, et al.
Published: (2026)
Coordinating Spot and Contract Supply in Freight Marketplaces
by: Kaminsky, Philip, et al.
Published: (2026)
by: Kaminsky, Philip, et al.
Published: (2026)
Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances
by: Besbes, Omar, et al.
Published: (2022)
by: Besbes, Omar, et al.
Published: (2022)
A Decomposition Theorem for Dynamic Flows
by: Graf, Lukas, et al.
Published: (2024)
by: Graf, Lukas, et al.
Published: (2024)
A Variational-Calculus Approach to Online Algorithm Design and Analysis
by: Xu, Pan
Published: (2025)
by: Xu, Pan
Published: (2025)
Dynamic Pricing for Reusable Resources: The Power of Two Prices
by: Balseiro, Santiago R., et al.
Published: (2023)
by: Balseiro, Santiago R., et al.
Published: (2023)
Dynamic Batching of Online Arrivals to Leverage Economies of Scale
by: Bhimaraju, Akhil, et al.
Published: (2023)
by: Bhimaraju, Akhil, et al.
Published: (2023)
Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time
by: Segev, Danny
Published: (2025)
by: Segev, Danny
Published: (2025)
A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
by: Sun, Shuo, et al.
Published: (2024)
by: Sun, Shuo, et al.
Published: (2024)
The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings
by: Hou, Jiaxin, et al.
Published: (2023)
by: Hou, Jiaxin, et al.
Published: (2023)
Handicap reduction for linear complementarity problems
by: -Nagy, Marianna E., et al.
Published: (2026)
by: -Nagy, Marianna E., et al.
Published: (2026)
Beyond Smoothed Analysis: Analyzing the Simplex Method by the Book
by: Bach, Eleon, et al.
Published: (2025)
by: Bach, Eleon, et al.
Published: (2025)
Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods
by: Li, Gen, et al.
Published: (2023)
by: Li, Gen, et al.
Published: (2023)
Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers
by: Brubaker, Kyle, et al.
Published: (2025)
by: Brubaker, Kyle, et al.
Published: (2025)
Approximate Message Passing for Quantum State Tomography
by: Siekierski, Noah, et al.
Published: (2025)
by: Siekierski, Noah, et al.
Published: (2025)
A greedy approach for increased vehicle utilization in ridesharing networks
by: Makhdomi, Aqsa Ashraf, et al.
Published: (2023)
by: Makhdomi, Aqsa Ashraf, et al.
Published: (2023)
BalLOT: Balanced $k$-means clustering with optimal transport
by: Luo, Wenyan, et al.
Published: (2025)
by: Luo, Wenyan, et al.
Published: (2025)
Gap-Free Clustering: Sensitivity and Robustness of SDP
by: Zurek, Matthew, et al.
Published: (2023)
by: Zurek, Matthew, et al.
Published: (2023)
(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
by: Hunkenschröder, Christoph, et al.
Published: (2025)
by: Hunkenschröder, Christoph, et al.
Published: (2025)
Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
by: Kasperski, Adam, et al.
Published: (2024)
by: Kasperski, Adam, et al.
Published: (2024)
Generalized Assignment and Knapsack Problems in the Random-Order Model
by: Klimm, Max, et al.
Published: (2025)
by: Klimm, Max, et al.
Published: (2025)
Radial Isotropic Position via an Implicit Newton's Method
by: Jambulapati, Arun, et al.
Published: (2025)
by: Jambulapati, Arun, et al.
Published: (2025)
An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
by: Chen, Yike, et al.
Published: (2024)
by: Chen, Yike, et al.
Published: (2024)
Balancing Gradient and Hessian Queries in Non-Convex Optimization
by: Adil, Deeksha, et al.
Published: (2025)
by: Adil, Deeksha, et al.
Published: (2025)
Deriving the Gradients of Some Popular Optimal Transport Algorithms
by: Xie, Fangzhou
Published: (2025)
by: Xie, Fangzhou
Published: (2025)
Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
by: Su, Yuexin, et al.
Published: (2026)
by: Su, Yuexin, et al.
Published: (2026)
Labeling Methods for Partially Ordered Paths
by: Euler, Ricardo, et al.
Published: (2023)
by: Euler, Ricardo, et al.
Published: (2023)
Sparse Submodular Function Minimization
by: Graur, Andrei, et al.
Published: (2023)
by: Graur, Andrei, et al.
Published: (2023)
On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
by: Shi, Haoyan, et al.
Published: (2024)
by: Shi, Haoyan, et al.
Published: (2024)
On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems
by: Sergeev, Ivan
Published: (2024)
by: Sergeev, Ivan
Published: (2024)
Distributionally Robust Newsvendor on a Metric
by: Foussoul, Ayoub, et al.
Published: (2024)
by: Foussoul, Ayoub, et al.
Published: (2024)
ALNS for Tugboat Scheduling in Inland Waterway
by: Ma, Zihang
Published: (2025)
by: Ma, Zihang
Published: (2025)
The Robust Bilevel Selection Problem
by: Henke, Dorothee
Published: (2024)
by: Henke, Dorothee
Published: (2024)
A First Order Method for Linear Programming Parameterized by Circuit Imbalance
by: Cole, Richard, et al.
Published: (2023)
by: Cole, Richard, et al.
Published: (2023)
A Faster Parametric Search for the Integral Quickest Transshipment Problem
by: Anapolska, Mariia, et al.
Published: (2025)
by: Anapolska, Mariia, et al.
Published: (2025)
Approximating $q \rightarrow p$ Norms of Non-Negative Matrices in Nearly-Linear Time
by: Objois, Étienne, et al.
Published: (2025)
by: Objois, Étienne, et al.
Published: (2025)
Acceleration by Stepsize Hedging I: Multi-Step Descent and the Silver Stepsize Schedule
by: Altschuler, Jason M., et al.
Published: (2023)
by: Altschuler, Jason M., et al.
Published: (2023)
A rounding and clustering-based exact algorithm for the p-center problem
by: Ales, Zacharie, et al.
Published: (2024)
by: Ales, Zacharie, et al.
Published: (2024)
Extracting Dual Solutions via Primal Optimizers
by: Carmon, Yair, et al.
Published: (2024)
by: Carmon, Yair, et al.
Published: (2024)
Similar Items
-
Polyamorous Scheduling
by: Gąsieniec, Leszek, et al.
Published: (2024) -
Parameterized Complexity of Scheduling Problems in Robotic Process Automation
by: Dvořák, Michal, et al.
Published: (2026) -
Coordinating Spot and Contract Supply in Freight Marketplaces
by: Kaminsky, Philip, et al.
Published: (2026) -
Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances
by: Besbes, Omar, et al.
Published: (2022) -
A Decomposition Theorem for Dynamic Flows
by: Graf, Lukas, et al.
Published: (2024)