Imagen de Portada

Tight Localizations of Feedback Sets

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Hecht, Michael, Gonciarz, Krzysztof, Horvát, Szabolcs
Formato:	Preprint
Publicado:	2020
Materias:	Discrete Mathematics 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

Tight Paths and Tight Pairs in Weighted Directed Graphs
por: Balcázar, José Luis
Publicado: (2025)

A Tight Bound on Localization of Electrical Flows
por: Gurel-Gurevich, Ori, et al.
Publicado: (2026)

Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time
por: Berthe, Gaétan, et al.
Publicado: (2024)

Tight Inapproximability of Target Set Reconfiguration
por: Ohsaka, Naoto
Publicado: (2024)

Nearly Tight Bounds on Testing of Metric Properties
por: Bao, Yiqiao, et al.
Publicado: (2024)

Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem
por: Shook, James M., et al.
Publicado: (2025)

Tight Bounds for Sparsifying Random CSPs
por: Brakensiek, Joshua, et al.
Publicado: (2025)

Treewidth Parameterized by Feedback Vertex Number
por: Molter, Hendrik, et al.
Publicado: (2025)

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
por: Chakraborty, Dipayan, et al.
Publicado: (2024)

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

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

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

Partially Ordered Sets Corresponding to the Partition Problem
por: Kubo, Susumu
Publicado: (2024)

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

The Parameterized Complexity Landscape of Two-Sets Cut-Uncut
por: Bentert, Matthias, et al.
Publicado: (2024)

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

Subexponential and Parameterized Mixing Times of Glauber Dynamics on Independent Sets
por: Marin, Malory
Publicado: (2025)

Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees
por: Efthymiou, Charilaos, et al.
Publicado: (2023)

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

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

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

On Tight Robust Coresets for $k$-Medians Clustering
por: Huang, Lingxiao, et al.
Publicado: (2025)

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

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

Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs
por: Srinivasan, Eshwar, et al.
Publicado: (2026)

Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting
por: Avila, Tatiana Rocha, et al.
Publicado: (2026)

Fairness in Repetitive Scheduling
por: Hermelin, Danny, et al.
Publicado: (2021)

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

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
por: Majewski, Konrad, et al.
Publicado: (2022)

Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity
por: Jain, Vishesh, et al.
Publicado: (2026)

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

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

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

Continuous Petri Nets for Fast Yield Computation: Polynomial-Time and MILP Approaches
por: Jordon, Addie, et al.
Publicado: (2025)

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

Fast Makespan Minimization via Short ILPs
por: Hermelin, Danny, et al.
Publicado: (2026)

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

A Unified Approach to Minimizing Symmetric Submodular Functions
por: Iwata, Satoru, et al.
Publicado: (2026)

Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice
por: Tan, Jingjing
Publicado: (2024)

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
por: Harada, Tsubasa
Publicado: (2024)