Imagen de Portada

Approximation Algorithms for the $b$-Matching and List-Restricted Variants of MaxQAP

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Nanta, Jiratchaphat, Suppakitpaisarn, Vorapong, Sripratak, Piyashat
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network
por: Manna, Bubai, et al.
Publicado: (2024)

A Parameterized Perspective on Uniquely Restricted Matchings
por: Chaudhary, Juhi, et al.
Publicado: (2025)

Approximation Algorithms for Optimal Hopsets
por: Dinitz, Michael, et al.
Publicado: (2025)

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

An Approximation Algorithm for Monotone Submodular Cost Allocation
por: Mizutani, Ryuhei
Publicado: (2025)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
por: Wang, Chen, et al.
Publicado: (2024)

A Constant-Approximation Algorithm for Budgeted Sweep Coverage with Mobile Sensors
por: Liang, Wei, et al.
Publicado: (2024)

Max Weight Independent Set in sparse graphs with no long claws
por: Abrishami, Tara, et al.
Publicado: (2023)

On the Relationship Between Several Variants of the Linear Hashing Conjecture
por: Westover, Alek
Publicado: (2023)

Multi-Pass Streaming Lower Bounds for Approximating Max-Cut
por: Fei, Yumou, et al.
Publicado: (2025)

Stable Approximation Algorithms for Dominating Set and Independent Set
por: de Berg, Mark, et al.
Publicado: (2024)

Unsplittable Cost Flows from Unweighted Error-Bounded Variants
por: Swamy, Chaitanya, et al.
Publicado: (2025)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors
por: Bourneuf, Romain, et al.
Publicado: (2025)

Solving the List Coloring Problem through a Branch-and-Price algorithm
por: Lucci, Mauro, et al.
Publicado: (2023)

String Matching with a Dynamic Pattern
por: Monteiro, Bruno, et al.
Publicado: (2025)

Approximating Submodular Matroid-Constrained Partitioning
por: Bérczi, Kristóf, et al.
Publicado: (2025)

(Approximate) Matrix Multiplication via Convolutions
por: Uffenheimer, Yahel, et al.
Publicado: (2025)

An Approximate Generalization of the Okamura-Seymour Theorem
por: Kumar, Nikhil
Publicado: (2022)

Approximate Realizations for Outerplanaric Degree Sequences
por: Bar-Noy, Amotz, et al.
Publicado: (2024)

A Constant-Factor Approximation for Directed Latency
por: Blauth, Jannis, et al.
Publicado: (2025)

Exponential Time Approximation for Coloring 3-Colorable Graphs
por: Guruswami, Venkatesan, et al.
Publicado: (2024)

Approximation algorithms for non-sequential star packing problems
por: Hu, Mengyuan, et al.
Publicado: (2024)

Approximation of Spanning Tree Congestion using Hereditary Bisection
por: Kolman, Petr
Publicado: (2024)

Approximately covering vertices by order-$5$ or longer paths
por: Gong, Mingyang, et al.
Publicado: (2024)

Approximating Maximum Edge 2-Coloring by Normalizing Graphs
por: Mömke, Tobias, et al.
Publicado: (2024)

Reconfiguration of List Colourings
por: Cambie, Stijn, et al.
Publicado: (2025)

A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals
por: Aouad, Ali, et al.
Publicado: (2022)

Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem
por: Disser, Yann, et al.
Publicado: (2024)

Simultaneously Approximating All $\ell_p$-norms in Correlation Clustering
por: Davies, Sami, et al.
Publicado: (2023)

Variants of Merge-Width and Applications
por: Drabik, Karolina, et al.
Publicado: (2026)

Algorithmic Aspects of Temporal Betweenness
por: Buß, Sebastian, et al.
Publicado: (2020)

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

Greedy Algorithms for Shortcut Sets and Hopsets
por: Bals, Ben, et al.
Publicado: (2025)

A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
por: Ghanbari, Babak, et al.
Publicado: (2026)

Greedy Gray Codes for some Restricted Classes of Binary Words
por: Hassler, Nathanaël, et al.
Publicado: (2024)

Minimum Sum Set Cover: Structures and Algorithm
por: Zhang, Zhongyi, et al.
Publicado: (2026)

Terminal Steiner tree problem : Complexity and Algorithms
por: S, Jyothish, et al.
Publicado: (2026)

Improved Streaming Algorithm for Fair $k$-Center Clustering
por: Guo, Longkun, et al.
Publicado: (2025)

Revisiting Tree Isomorphism: An Algorithmic Bric-à-Brac
por: Ingels, Florian
Publicado: (2023)

Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
por: Foucaud, Florent, et al.
Publicado: (2026)