Image de couverture de livre

Stochastic Optimization and Learning for Two-Stage Supplier Problems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Brubach, Brian, Grammel, Nathaniel, Harris, David G., Srinivasan, Aravind, Tsepenekas, Leonidas, Vullikanti, Anil
Format:	Preprint
Publié:	2020
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes
par: Brubach, Brian, et autres
Publié: (2021)

Proportionally Fair Matching via Randomized Rounding
par: Duppala, Sharmila, et autres
Publié: (2024)

Dependent randomized rounding for clustering and partition systems with knapsack constraints
par: Harris, David G., et autres
Publié: (2017)

Controlling the Spread of Epidemics on Networks with Differential Privacy
par: Nguyen, Dung, et autres
Publié: (2025)

Online Dependent Rounding Schemes for Bipartite Matchings, with Applications
par: Joseph, et autres
Publié: (2023)

Differentially Private and Scalable Estimation of the Network Principal Component
par: Khayatian, Alireza, et autres
Publié: (2025)

Differentially private exact recovery for stochastic block models
par: Nguyen, Dung, et autres
Publié: (2024)

Differentially Private Densest Subgraph Detection
par: Nguyen, Dung, et autres
Publié: (2021)

Differentially private graph coloring
par: Xie, Michael, et autres
Publié: (2026)

Barter Exchange with Shared Item Valuations
par: Luque, Juan, et autres
Publié: (2024)

Colorful Priority $k$-Supplier
par: Chekuri, Chandra, et autres
Publié: (2024)

Fault-tolerant $k$-Supplier with Outliers
par: Chakrabarty, Deeparnab, et autres
Publié: (2023)

Dimension-Free Correlated Sampling for the Hypersimplex
par: Joseph, et autres
Publié: (2025)

Separating $k$-Median from the Supplier Version
par: Anand, Aditya, et autres
Publié: (2024)

Concentration of Submodular Functions and Read-k Families Under Negative Dependence
par: Duppala, Sharmila, et autres
Publié: (2023)

Assigning Agents to Increase Network-Based Neighborhood Diversity
par: Qiu, Zirou, et autres
Publié: (2023)

Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication
par: Harris, David G.
Publié: (2021)

Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time
par: Harris, David G.
Publié: (2023)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
par: MacRury, Calum, et autres
Publié: (2022)

Optimal Rounding for Two-Stage Bipartite Matching
par: Pollner, Tristan, et autres
Publié: (2025)

Algorithms and Hardness Results for the $(k,\ell)$-Cover Problem
par: Madani, Amirali, et autres
Publié: (2025)

Simple and efficient four-cycle counting on sparse graphs
par: Burkhardt, Paul, et autres
Publié: (2023)

Improved parallel derandomization via finite automata with applications
par: Giliberti, Jeff, et autres
Publié: (2024)

Near-Optimal Sparsifiers for Stochastic Knapsack and Assignment Problems
par: Dughmi, Shaddin, et autres
Publié: (2025)

Stochastic Traveling Salesperson Problem with Neighborhoods for Object Detection
par: Peng, Cheng, et autres
Publié: (2024)

An FPT algorithm for Matching Cut and d-cut
par: Aravind, N R, et autres
Publié: (2021)

The Bichromatic Two-Center Problem on Graphs
par: Sun, Qi, et autres
Publié: (2025)

Approximation Algorithms for the Cumulative Vehicle Routing Problem with Stochastic Demands
par: Zhao, Jingyang, et autres
Publié: (2025)

The Two-Center Problem of Uncertain Points on Trees
par: Xu, Haitao, et autres
Publié: (2024)

First Order Stochastic Optimization with Oblivious Noise
par: Diakonikolas, Ilias, et autres
Publié: (2024)

The Two-Center Problem of Uncertain Points on Cactus Graphs
par: Xu, Haitao, et autres
Publié: (2024)

Two Complexity Results on Spanning-Tree Congestion Problems
par: Atalig, Sunny, et autres
Publié: (2026)

Two New Upper Bounds for the Maximum k-plex Problem
par: Zheng, Jiongzhi, et autres
Publié: (2023)

Simple parallel estimation of the partition ratio for Gibbs distributions
par: Harris, David G., et autres
Publié: (2025)

A faster algorithm for Vertex Cover parameterized by solution size
par: Harris, David G., et autres
Publié: (2022)

On the Two Paths Theorem and the Two Disjoint Paths Problem
par: Humeau, Samuel, et autres
Publié: (2025)

When to Identify Is to Control: On the Controllability of Combinatorial Optimization Problems
par: Klimm, Max, et autres
Publié: (2026)

Semi-Bandit Learning for Monotone Stochastic Optimization
par: Agarwal, Arpit, et autres
Publié: (2023)

Online Two-Stage Submodular Maximization
par: Nikolaou, Iasonas, et autres
Publié: (2025)

Generating Satisfiable Benchmark Instances for Stable Roommates Problems with Optimization
par: Yılmaz, Baturay, et autres
Publié: (2025)