Imagen de Portada

A Tie-breaking based Local Search Algorithm for Stable Matching Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Qiu, Junyuan
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Artificial Intelligence Discrete Mathematics Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Primal-Dual Extension of the Goemans--Williamson Algorithm for the Weighted Fractional Cut-Covering Problem
por: Proença, Nathan Benedetto, et al.
Publicado: (2023)

Efficient Local and Tabu Search Strategies for Large-Scale Quadratic Integer Programming
por: Wang, Haibo, et al.
Publicado: (2024)

Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem
por: Fujiwara, Hiroshi, et al.
Publicado: (2025)

Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack
por: Schade, Jamico, et al.
Publicado: (2023)

Generalized Cuts and Grothendieck Covers: a Primal-Dual Approximation Framework Extending the Goemans--Williamson Algorithm
por: Proença, Nathan Benedetto, et al.
Publicado: (2024)

Total Matching and Subdeterminants
por: Ferrarini, Luca, et al.
Publicado: (2023)

A 1/2-Approximation for Budgeted $k$-Submodular Maximization
por: Wang, Chenhao
Publicado: (2025)

New Sequence-Independent Lifting Techniques for Cutting Planes and When They Induce Facets
por: Prasad, Siddharth, et al.
Publicado: (2024)

Flow Shop Scheduling with Stochastic Reentry
por: von Aspern, Maximilian, et al.
Publicado: (2026)

ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization
por: Gallart, Joan Vendrell, et al.
Publicado: (2025)

Multiplicative assignment with upgrades
por: Armbruster, Alexander, et al.
Publicado: (2025)

Complexity of polytope diameters via perfect matchings
por: Nöbel, Christian, et al.
Publicado: (2024)

Integer programs with nearly totally unimodular matrices: the cographic case
por: Aprile, Manuel, et al.
Publicado: (2024)

Totally $Δ$-modular IPs with two non-zeros in most rows
por: Kober, Stefan
Publicado: (2024)

Vertex-ordering and arc-partitioning problems
por: Borsik, Nóra A., et al.
Publicado: (2025)

Integer programs with bounded subdeterminants and two nonzeros per row
por: Fiorini, Samuel, et al.
Publicado: (2021)

Separable convex optimization over indegree polytopes
por: Borsik, Nóra A., et al.
Publicado: (2025)

Prefix-bounded matrices
por: Borsik, Nóra A., et al.
Publicado: (2025)

On the Congruency-Constrained Matroid Base
por: Liu, Siyue, et al.
Publicado: (2023)

Periodic trajectories in P-time event graphs and the non-positive circuit weight problem
por: Zorzenon, Davide, et al.
Publicado: (2021)

Algorithmic aspects of semistability of quiver representations
por: Iwamasa, Yuni, et al.
Publicado: (2024)

A Θ(m^9) ternary minimum-cost network flow LP model of the Assignment Problem polytope with applications to hard combinatorial optimization problems
por: Diaby, Moustapha
Publicado: (2016)

Parallel Token Swapping for Qubit Routing
por: Bansal, Ishan, et al.
Publicado: (2024)

Simultaneous Network Design with Restricted Link Usage
por: Kakimura, Naonori, et al.
Publicado: (2025)

Difference of Submodular Minimization via DC Programming
por: Halabi, Marwa El, et al.
Publicado: (2023)

Semidefinite programming and linear equations vs. homomorphism problems
por: Ciardo, Lorenzo, et al.
Publicado: (2023)

A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates
por: Weiss, Eyal, et al.
Publicado: (2022)

Generalized Nash Equilibrium Problems with Mixed-Integer Variables
por: Harks, Tobias, et al.
Publicado: (2021)

Efficient approximation schemes for scheduling on a stochastic number of machines
por: Epstein, Leah, et al.
Publicado: (2024)

NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability
por: Kar, Prem Nigam, et al.
Publicado: (2024)

Robust Permutation Flowshops Under Budgeted Uncertainty
por: Goldberg, Noam, et al.
Publicado: (2026)

Better and Simpler Reducibility Bounds over the Integers
por: Levin, Asaf
Publicado: (2025)

Matching Algorithms in the Sparse Stochastic Block Model
por: Brandenberger, Anna, et al.
Publicado: (2024)

The Central Spanning Tree Problem
por: Sanmartín, Enrique Fita, et al.
Publicado: (2024)

Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
por: Komusiewicz, Christian, et al.
Publicado: (2026)

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
por: Harada, Tsubasa, et al.
Publicado: (2024)

Approximation Algorithms for the $b$-Matching and List-Restricted Variants of MaxQAP
por: Nanta, Jiratchaphat, et al.
Publicado: (2025)

Parameterized Algorithms for Balanced Cluster Edge Modification Problems
por: Madathil, Jayakrishnan, et al.
Publicado: (2024)

Algorithmic Results for Weak Roman Domination Problem in Graphs
por: Paul, Kaustav, et al.
Publicado: (2024)

Computing and Learning on Combinatorial Data
por: Zhang, Simon
Publicado: (2025)