Imagen de Portada

Second Price Matching with Complete Allocation and Degree Constraints

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Pinchasi, Rom, Singer, Neta, Vogl, Lukas, Wei, Jiaye
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Computational Complexity Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On Stable Cutsets in General and Minimum Degree Constrained Graphs
por: Vroon, Mats, et al.
Publicado: (2025)

Recognizing Sumsets is NP-Complete
por: Abboud, Amir, et al.
Publicado: (2024)

A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees
por: Shao, Shuai, et al.
Publicado: (2023)

Bipartite Exact Matching in P
por: Du, Yuefeng
Publicado: (2026)

The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching, or Matching
por: Dreier, Jan, et al.
Publicado: (2026)

Fractional Linear Matroid Matching is in quasi-NC
por: Gurjar, Rohit, et al.
Publicado: (2024)

On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
por: DeHaan, Ian, et al.
Publicado: (2025)

Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius
por: Lucke, Felicia, et al.
Publicado: (2023)

Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
por: Abrahamsen, Mikkel, et al.
Publicado: (2020)

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

Relative-error unateness testing
por: Chen, Xi, et al.
Publicado: (2025)

Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms
por: Antoniadis, Antonios, et al.
Publicado: (2025)

Relative-error testing of conjunctions and decision lists
por: Chen, Xi, et al.
Publicado: (2025)

Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs
por: Kutner, David C., et al.
Publicado: (2025)

Asymptotically Optimal Inapproximability of E$k$-SAT Reconfiguration
por: Hirahara, Shuichi, et al.
Publicado: (2025)

Boolean function monotonicity testing requires (almost) $n^{1/2}$ queries
por: Chen, Mark, et al.
Publicado: (2025)

Lower Bounds for Linear Operators
por: Ko, Young Kun
Publicado: (2025)

Testing Juntas and Junta Subclasses with Relative Error
por: Chen, Xi, et al.
Publicado: (2025)

A note on approximating the average degree of bounded arboricity graphs
por: Eden, Talya, et al.
Publicado: (2026)

Parameterised distance to local irregularity
por: Fioravantes, Foivos, et al.
Publicado: (2023)

Optimal PSPACE-hardness of Approximating Set Cover Reconfiguration
por: Hirahara, Shuichi, et al.
Publicado: (2024)

On Approximate Reconfigurability of Label Cover
por: Ohsaka, Naoto
Publicado: (2023)

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
por: Foucaud, Florent, et al.
Publicado: (2023)

Counting Locally Optimal Tours in the TSP
por: Manthey, Bodo, et al.
Publicado: (2024)

A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
por: Hamm, Thekla, et al.
Publicado: (2026)

Placing Green Bridges Optimally, with a Multivariate Analysis
por: Fluschnik, Till, et al.
Publicado: (2021)

Finding a Minimum Spanning Tree with a Small Non-Terminal Set
por: Hanaka, Tesshu, et al.
Publicado: (2023)

Relative-error monotonicity testing
por: Chen, Xi, et al.
Publicado: (2024)

Parameterized Complexity of Streaming Diameter and Connectivity Problems
por: Oostveen, Jelle J., et al.
Publicado: (2022)

Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs
por: Johnson, Matthew, et al.
Publicado: (2022)

Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound
por: Lill, Jonas, et al.
Publicado: (2024)

Breadth-First Search Trees with Many or Few Leaves
por: Beisegel, Jesse, et al.
Publicado: (2026)

On the parameterized complexity of Broadcast Independence and Broadcast Packing
por: Dumont, Joanne, et al.
Publicado: (2026)

Maximum $k$- vs. $\ell$-colourings of graphs
por: Nakajima, Tamio-Vesa, et al.
Publicado: (2023)

Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems
por: Hirahara, Shuichi, et al.
Publicado: (2023)

The Days On Days Off Scheduling Problem
por: Nießen, Fabien, et al.
Publicado: (2024)

The Complexity of Transitively Orienting Temporal Graphs
por: Mertzios, George B., et al.
Publicado: (2021)

Channel allocation revisited through 1-extendability of graphs
por: Busson, Anthony, et al.
Publicado: (2024)

Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity
por: Conrado, Giovanna K., et al.
Publicado: (2023)

1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise
por: Ciardo, Lorenzo, et al.
Publicado: (2023)