Imagen de Portada

Stochastic Optimization and Learning for Two-Stage Supplier Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Brubach, Brian, Grammel, Nathaniel, Harris, David G., Srinivasan, Aravind, Tsepenekas, Leonidas, Vullikanti, Anil
Formato:	Preprint
Publicado:	2020
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes
por: Brubach, Brian, et al.
Publicado: (2021)

Proportionally Fair Matching via Randomized Rounding
por: Duppala, Sharmila, et al.
Publicado: (2024)

Dependent randomized rounding for clustering and partition systems with knapsack constraints
por: Harris, David G., et al.
Publicado: (2017)

Controlling the Spread of Epidemics on Networks with Differential Privacy
por: Nguyen, Dung, et al.
Publicado: (2025)

Online Dependent Rounding Schemes for Bipartite Matchings, with Applications
por: Joseph, et al.
Publicado: (2023)

Differentially Private and Scalable Estimation of the Network Principal Component
por: Khayatian, Alireza, et al.
Publicado: (2025)

Differentially private exact recovery for stochastic block models
por: Nguyen, Dung, et al.
Publicado: (2024)

Differentially Private Densest Subgraph Detection
por: Nguyen, Dung, et al.
Publicado: (2021)

Differentially private graph coloring
por: Xie, Michael, et al.
Publicado: (2026)

Barter Exchange with Shared Item Valuations
por: Luque, Juan, et al.
Publicado: (2024)

Colorful Priority $k$-Supplier
por: Chekuri, Chandra, et al.
Publicado: (2024)

Fault-tolerant $k$-Supplier with Outliers
por: Chakrabarty, Deeparnab, et al.
Publicado: (2023)

Dimension-Free Correlated Sampling for the Hypersimplex
por: Joseph, et al.
Publicado: (2025)

Separating $k$-Median from the Supplier Version
por: Anand, Aditya, et al.
Publicado: (2024)

Concentration of Submodular Functions and Read-k Families Under Negative Dependence
por: Duppala, Sharmila, et al.
Publicado: (2023)

Assigning Agents to Increase Network-Based Neighborhood Diversity
por: Qiu, Zirou, et al.
Publicado: (2023)

Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication
por: Harris, David G.
Publicado: (2021)

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

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
por: MacRury, Calum, et al.
Publicado: (2022)

Optimal Rounding for Two-Stage Bipartite Matching
por: Pollner, Tristan, et al.
Publicado: (2025)

Algorithms and Hardness Results for the $(k,\ell)$-Cover Problem
por: Madani, Amirali, et al.
Publicado: (2025)

Simple and efficient four-cycle counting on sparse graphs
por: Burkhardt, Paul, et al.
Publicado: (2023)

Improved parallel derandomization via finite automata with applications
por: Giliberti, Jeff, et al.
Publicado: (2024)

Near-Optimal Sparsifiers for Stochastic Knapsack and Assignment Problems
por: Dughmi, Shaddin, et al.
Publicado: (2025)

Stochastic Traveling Salesperson Problem with Neighborhoods for Object Detection
por: Peng, Cheng, et al.
Publicado: (2024)

An FPT algorithm for Matching Cut and d-cut
por: Aravind, N R, et al.
Publicado: (2021)

The Bichromatic Two-Center Problem on Graphs
por: Sun, Qi, et al.
Publicado: (2025)

Approximation Algorithms for the Cumulative Vehicle Routing Problem with Stochastic Demands
por: Zhao, Jingyang, et al.
Publicado: (2025)

The Two-Center Problem of Uncertain Points on Trees
por: Xu, Haitao, et al.
Publicado: (2024)

First Order Stochastic Optimization with Oblivious Noise
por: Diakonikolas, Ilias, et al.
Publicado: (2024)

The Two-Center Problem of Uncertain Points on Cactus Graphs
por: Xu, Haitao, et al.
Publicado: (2024)

Two Complexity Results on Spanning-Tree Congestion Problems
por: Atalig, Sunny, et al.
Publicado: (2026)

Two New Upper Bounds for the Maximum k-plex Problem
por: Zheng, Jiongzhi, et al.
Publicado: (2023)

Simple parallel estimation of the partition ratio for Gibbs distributions
por: Harris, David G., et al.
Publicado: (2025)

A faster algorithm for Vertex Cover parameterized by solution size
por: Harris, David G., et al.
Publicado: (2022)

On the Two Paths Theorem and the Two Disjoint Paths Problem
por: Humeau, Samuel, et al.
Publicado: (2025)

When to Identify Is to Control: On the Controllability of Combinatorial Optimization Problems
por: Klimm, Max, et al.
Publicado: (2026)

Semi-Bandit Learning for Monotone Stochastic Optimization
por: Agarwal, Arpit, et al.
Publicado: (2023)

Online Two-Stage Submodular Maximization
por: Nikolaou, Iasonas, et al.
Publicado: (2025)

Generating Satisfiable Benchmark Instances for Stable Roommates Problems with Optimization
por: Yılmaz, Baturay, et al.
Publicado: (2025)