Image de couverture de livre

A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Aouad, Ali, Ma, Will
Format:	Preprint
Publié:	2022
Sujets:	Data Structures and Algorithms Discrete Mathematics
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)

Matching Algorithms in the Sparse Stochastic Block Model
par: Brandenberger, Anna, et autres
Publié: (2024)

A Parameterized Perspective on Uniquely Restricted Matchings
par: Chaudhary, Juhi, et autres
Publié: (2025)

String Matching with a Dynamic Pattern
par: Monteiro, Bruno, et autres
Publié: (2025)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
par: Ma, Will, et autres
Publié: (2024)

A Simple and Fast $(3+\varepsilon)$-approximation for Constrained Correlation Clustering
par: Veldt, Nate
Publié: (2025)

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
par: Harada, Tsubasa, et autres
Publié: (2024)

The Role of Dimension in the Online Chasing Problem
par: Papazov, Hristo
Publié: (2023)

Approximation Algorithms for the $b$-Matching and List-Restricted Variants of MaxQAP
par: Nanta, Jiratchaphat, et autres
Publié: (2025)

Simultaneously Approximating All $\ell_p$-norms in Correlation Clustering
par: Davies, Sami, et autres
Publié: (2023)

Online Graph Balancing and the Power of Two Choices
par: Bansal, Nikhil, et autres
Publié: (2026)

Online Graph Coloring for $k$-Colorable Graphs
par: Kawarabayashi, Ken-ichi, et autres
Publié: (2025)

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
par: Harada, Tsubasa
Publié: (2024)

Efficient Online Sensitivity Analysis For The Injective Bottleneck Path Problem
par: Kaymakov, Kirill V., et autres
Publié: (2024)

Online Correlation Clustering: Simultaneously Optimizing All $\ell_p$-norms
par: Davies, Sami, et autres
Publié: (2025)

Towards an Optimal Contention Resolution Scheme for Matchings
par: Nuti, Pranav, et autres
Publié: (2022)

Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
par: Abbasi, Ali, et autres
Publié: (2026)

Online Coloring of Short Intervals
par: Chybowska-Sokół, Joanna, et autres
Publié: (2018)

A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
par: Ghanbari, Babak, et autres
Publié: (2026)

Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs
par: Dudeja, Aditi, et autres
Publié: (2024)

A survey of Chernoff and Hoeffding bounds
par: Gerbessiotis, Alexandros V.
Publié: (2025)

A Constant-Factor Approximation for Directed Latency
par: Blauth, Jannis, et autres
Publié: (2025)

A Tale of Santa Claus, Hypergraphs and Matroids
par: Davies, Sami, et autres
Publié: (2018)

A Unified Approach to Minimizing Symmetric Submodular Functions
par: Iwata, Satoru, et autres
Publié: (2026)

Sequential testing problem: A follow-up review
par: Ünlüyurt, Tonguç
Publié: (2025)

A polynomial kernel for vertex deletion into bipartite permutation graphs
par: Derbisz, Jan
Publié: (2021)

A Finer View of the Parameterized Landscape of Labeled Graph Contractions
par: Mathur, Yashaswini, et autres
Publié: (2025)

A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection
par: Abboud, Amir, et autres
Publié: (2025)

A Constant-Approximation Algorithm for Budgeted Sweep Coverage with Mobile Sensors
par: Liang, Wei, et autres
Publié: (2024)

A column generation algorithm for finding co-3-plexes in chordal graphs
par: Dupont-Bouillard, Alexandre
Publié: (2026)

Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
par: Bentert, Matthias, et autres
Publié: (2026)

A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs
par: Paul-Pena, Daniel, et autres
Publié: (2022)

Bipartite Exact Matching in P
par: Du, Yuefeng
Publié: (2026)

The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching, or Matching
par: Dreier, Jan, et autres
Publié: (2026)

Fractional Linear Matroid Matching is in quasi-NC
par: Gurjar, Rohit, et autres
Publié: (2024)

Parameterized Complexity of Path Set Packing
par: Aravind, N. R., et autres
Publié: (2022)

Packing $K_r$s in bounded degree graphs
par: McKay, Michael, et autres
Publié: (2022)

An Approximate Generalization of the Okamura-Seymour Theorem
par: Kumar, Nikhil
Publié: (2022)

On the Parameterized Intractability of Determinant Maximization
par: Ohsaka, Naoto
Publié: (2022)

The Complexity of Temporal Vertex Cover in Small-Degree Graphs
par: Hamm, Thekla, et autres
Publié: (2022)