Imagen de Portada

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bampis, Evripidis, Dogeas, Konstantinos, Erlebach, Thomas, Megow, Nicole, Schlöter, Jens, Trehan, Amitabh
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms 68Q25 F.2.2; G.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Scheduling with Obligatory Tests
por: Dogeas, Konstantinos, et al.
Publicado: (2024)

Amnesiac Flooding: Easy to break, hard to escape
por: Austin, Henry, et al.
Publicado: (2025)

Overlapping Biclustering
por: Bentert, Matthias, et al.
Publicado: (2025)

Simple minimally unsatisfiable subsets of 2-CNFs
por: Kullmann, Oliver, et al.
Publicado: (2026)

Maximum Matchings in Geometric Intersection Graphs
por: Bonnet, Édouard, et al.
Publicado: (2019)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
por: Lindermayr, Alexander, et al.
Publicado: (2025)

How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length
por: Huber, Michael Kiran
Publicado: (2024)

Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures
por: Hommelsheim, Felix, et al.
Publicado: (2025)

Set Parameterized Matching via Multi-Layer Hashing
por: Lewenstein, Moshe, et al.
Publicado: (2026)

Interval Graphs are Reconstructible
por: Heinrich, Irene, et al.
Publicado: (2025)

Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity
por: Liao, Chao, et al.
Publicado: (2022)

A faster algorithm for the construction of optimal factoring automata
por: Erlebach, Thomas, et al.
Publicado: (2024)

O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold
por: Bell, Tolson, et al.
Publicado: (2024)

Approximation Algorithms for Action-Reward Query-Commit Matching
por: Derakhshan, Mahsa, et al.
Publicado: (2026)

On (In)approximability of MaxMin Independent Set Reconfiguration
por: Hoang, Hung P., et al.
Publicado: (2026)

On Solving Simple Curved Nonograms
por: Löffler, Maarten, et al.
Publicado: (2025)

On Solving Reachability in Grid Digraphs using a Psuedoseparator
por: Jain, Rahul, et al.
Publicado: (2019)

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
por: Jansen, Klaus, et al.
Publicado: (2024)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
por: Chen, Yijia, et al.
Publicado: (2023)

On the twin-width of near-regular graphs
por: Heinrich, Irene, et al.
Publicado: (2025)

On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
por: Laekhanukit, Bundit
Publicado: (2024)

Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
por: Morse, Gregory, et al.
Publicado: (2026)

Experimental algorithms for the dualization problem
por: Mezzini, Mauro, et al.
Publicado: (2025)

Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications
por: Bonnet, Édouard, et al.
Publicado: (2026)

Steiner Tree Parameterized by Multiway Cut and Even Less
por: Jansen, Bart M. P., et al.
Publicado: (2024)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
por: DasGupta, Bhaskar, et al.
Publicado: (2026)

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness
por: Grochow, Joshua A., et al.
Publicado: (2025)

Extending Exact Integrality Gap Computations for the Metric TSP
por: Cook, William, et al.
Publicado: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
por: Heimann, Sophia, et al.
Publicado: (2026)

Logarithmic Weisfeiler--Leman and Treewidth
por: Levet, Michael, et al.
Publicado: (2023)

Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
por: Levet, Michael, et al.
Publicado: (2023)

Pliability and Approximating Max-CSPs
por: Romero, Miguel, et al.
Publicado: (2019)

Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
por: Komusiewicz, Christian, et al.
Publicado: (2023)

Subsequence Matching and Analysis Problems for Formal Languages
por: Fazekas, Szilárd Zsolt, et al.
Publicado: (2024)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
por: Heimann, Sophia, et al.
Publicado: (2025)

Large cliques and large independent sets: can they coexist?
por: Feige, Uriel, et al.
Publicado: (2025)

Parallel Algorithms for Group Isomorphism via Code Equivalence
por: Levet, Michael
Publicado: (2026)

Mim-Width is paraNP-complete
por: Bergougnoux, Benjamin, et al.
Publicado: (2025)

Answering Related Questions
por: Bonnet, Édouard
Publicado: (2025)

Treewidth Inapproximability and Tight ETH Lower Bound
por: Bonnet, Édouard
Publicado: (2024)