:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Bai, Yuhang, Bérczi, Kristóf, Siemelink, Johanna K.
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2511.18263
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Approximating maximum-size properly colored forests
por: Bai, Yuhang, et al.
Publicado: (2024)

Above-Guarantee Algorithm for Properly Colored Spanning Trees
por: Bai, Yuhang, et al.
Publicado: (2026)

Free-order secretary for two-sided independence systems
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Matroid Secretary via Labeling Schemes
por: Bérczi, Kristóf, et al.
Publicado: (2024)

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

Multiway Cuts with a Choice of Representatives
por: Bérczi, Kristóf, et al.
Publicado: (2024)

$\{s,t\}$-Separating Principal Partition Sequence of Submodular Functions
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Inverse matroid optimization under subset constraints
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Hypergraph Connectivity Augmentation in Strongly Polynomial Time
por: Bérczi, Kristóf, et al.
Publicado: (2024)

Splitting-off in Hypergraphs
por: Bérczi, Kristóf, et al.
Publicado: (2023)

Finding Spanning Trees with Perfect Matchings
por: Bérczi, Kristóf, et al.
Publicado: (2024)

Rainbow Arborescence Conjecture
por: Bérczi, Kristóf, et al.
Publicado: (2024)

Generalising the maximum independent set algorithm via Boolean networks
por: Gadouleau, Maximilien, et al.
Publicado: (2024)

Matroid Intersection under Minimum Rank Oracle
por: Bárász, Mihály, et al.
Publicado: (2024)

Lower bounds for graph reconstruction with maximal independent set queries
por: Michel, Lukas, et al.
Publicado: (2024)

Spanning tree congestion of proper interval graphs
por: Otachi, Yota
Publicado: (2026)

Packing $K_r$s in bounded degree graphs
por: McKay, Michael, et al.
Publicado: (2022)

Faster single-source shortest paths with negative real weights via proper hop distance
por: Huang, Yufan, et al.
Publicado: (2024)

Approximation and parameterized algorithms for covering disjointness-compliable set families
por: Nutov, Zeev, et al.
Publicado: (2025)

A note on finding long directed cycles above the minimum degree bound in 2-connected digraphs
por: Czyżewska, Jadwiga, et al.
Publicado: (2025)

Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests
por: Mestel, David, et al.
Publicado: (2024)

Clique-free t-matchings in degree-bounded graphs
por: Paluch, Katarzyna, et al.
Publicado: (2024)

Improved bounds for coloring locally sparse hypergraphs
por: Iliopoulos, Fotis
Publicado: (2020)

Improved linearly ordered colorings of hypergraphs via SDP rounding
por: Louis, Anand, et al.
Publicado: (2024)

Edge-coloring sparse graphs with $Δ$ colors in quasilinear time
por: Kowalik, Lukasz
Publicado: (2024)

Translating between the representations of an acyclic convex geometry of bounded degree
por: Defrain, Oscar, et al.
Publicado: (2025)

Differentially private graph coloring
por: Xie, Michael, et al.
Publicado: (2026)

New Diameter Approximations via Distance Oracle Techniques
por: Kirkpatrick, Yael, et al.
Publicado: (2026)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)

Optimal (degree+1)-Coloring in Congested Clique
por: Coy, Sam, et al.
Publicado: (2023)

Parameterized Approximability for Modular Linear Equations
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

OptiRefine: Densest subgraphs and maximum cuts with $k$ refinements
por: Tu, Sijing, et al.
Publicado: (2025)

Faster Approximation Algorithms for k-Center via Data Reduction
por: Filtser, Arnold, et al.
Publicado: (2025)

Near-optimal population protocols on bounded-degree trees
por: Rybicki, Joel, et al.
Publicado: (2026)

A branch-&-price approach to the unrooted maximum agreement forest problem
por: Frohn, Martin, et al.
Publicado: (2024)

Optimal FPT-Approximability for Modular Linear Equations
por: Dabrowski, Konrad K., et al.
Publicado: (2026)

Improved Approximation Algorithms for Three-Dimensional Knapsack
por: Jansen, Klaus, et al.
Publicado: (2025)

Approximating Multiple-Depot Capacitated Vehicle Routing via LP Rounding
por: Friggstad, Zachary, et al.
Publicado: (2025)

Probabilistic RNA Designability via Interpretable Ensemble Approximation and Dynamic Decomposition
por: Zhou, Tianshuo, et al.
Publicado: (2026)

Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter
por: Chalermsook, Parinya, et al.
Publicado: (2021)