Imagen de Portada

Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than $3^k$

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Liu, Yuxi, Xiao, Mingyu
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Deterministic Single Exponential Time Algorithms for Co-Path Packing and Co-Path Set Parameterized by Treewidth
por: Liu, Yuxi, et al.
Publicado: (2026)

Approximation Algorithms for Packing Cycles and Paths in Complete Graphs
por: Zhao, Jingyang, et al.
Publicado: (2023)

An Improved Approximation Algorithm for Maximum Weight 3-Path Packing
por: Zhao, Jingyang, et al.
Publicado: (2025)

The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing
por: Zhao, Jingyang, et al.
Publicado: (2024)

A Faster Deterministic Algorithm for Mader's $\mathcal{S}$-Path Packing
por: Iwata, Satoru, et al.
Publicado: (2024)

An Improved Approximation Algorithm for Metric Triangle Packing
por: Zhao, Jingyang, et al.
Publicado: (2024)

Packing Short Cycles
por: Bentert, Matthias, et al.
Publicado: (2024)

Parameterized Complexity of Path Set Packing
por: Aravind, N. R., et al.
Publicado: (2022)

Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity
por: de Vos, Tijn, et al.
Publicado: (2024)

Faster Parameterized Vertex Multicut
por: Chu, Huairui, et al.
Publicado: (2026)

A Refined Kernel for $d$-Hitting Set
por: Liu, Yuxi, et al.
Publicado: (2025)

Linear Kernels for $l$-Exact Component Order Connectivity
por: Liu, Yuxi, et al.
Publicado: (2026)

An Improved Kernel and Parameterized Algorithm for Almost Induced Matching
por: Liu, Yuxi, et al.
Publicado: (2023)

Graph Coloring Below Guarantees via Co-Triangle Packing
por: Akmal, Shyan, et al.
Publicado: (2025)

Green Bin Packing
por: Bibbens, Jackson, et al.
Publicado: (2025)

Faster Algorithms for Dual-Failure Replacement Paths
por: Chechik, Shiri, et al.
Publicado: (2024)

Faster Linear-Size And-Or Path and Adder Circuits
por: Brenner, Ulrich, et al.
Publicado: (2024)

The Support of Bin Packing is Exponential
por: Jansen, Klaus, et al.
Publicado: (2025)

On Constrained and k Shortest Paths
por: Bendahi, Abderrahim, et al.
Publicado: (2024)

ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
por: An, Shinwoo, et al.
Publicado: (2024)

Sampling List Packings
por: Camrud, Evan, et al.
Publicado: (2024)

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
por: Ashvinkumar, Vikrant, et al.
Publicado: (2024)

Packed Acyclic Deterministic Finite Automata
por: Shibata, Hiroki, et al.
Publicado: (2024)

The Power of Migrations in Dynamic Bin Packing
por: Mellou, Konstantina, et al.
Publicado: (2024)

Dynamic Matroids: Base Packing and Covering
por: de Vos, Tijn, et al.
Publicado: (2025)

Packing Compact Subgraphs with Applications to Districting
por: Chen, Ho-Lin, et al.
Publicado: (2026)

A Faster Deterministic Algorithm for Kidney Exchange via Representative Set
por: Tian, Kangyi, et al.
Publicado: (2026)

Packing Paths in Sparse Random Graphs
por: Vesna Iršič Chenoweth, et al.
Publicado: (2025)

On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
por: Bandopadhyay, Susobhan, et al.
Publicado: (2026)

A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem
por: Luo, Chunyu, et al.
Publicado: (2024)

Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions
por: Li, Jason, et al.
Publicado: (2025)

Hitting Meets Packing: How Hard Can it Be?
por: Focke, Jacob, et al.
Publicado: (2024)

Approximations and Hardness of Packing Partially Ordered Items
por: Doron-Arad, Ilan, et al.
Publicado: (2024)

Hardness and Tight Approximations of Demand Strip Packing
por: Jansen, Klaus, et al.
Publicado: (2024)

Online Bin Packing with Item Size Estimates
por: Gehnen, Matthias, et al.
Publicado: (2025)

Asymptotically Optimal Hardness for $k$-Set Packing and $k$-Matroid Intersection
por: Lee, Euiwoong, et al.
Publicado: (2024)

Survey of Results on the ModPath and ModCycle Problems
por: Amarilli, Antoine
Publicado: (2024)

Bin Packing under Random-Order: Breaking the Barrier of 3/2
por: Hebbar, Anish, et al.
Publicado: (2024)

Faster Algorithms for Sparse ILP and Hypergraph Multi-Packing/Multi-Cover Problems
por: Gribanov, Dmitry, et al.
Publicado: (2022)

Scalable Algorithms for 2-Packing Sets on Arbitrary Graphs
por: Borowitz, Jannick, et al.
Publicado: (2023)