Copertina

A Refined Kernel for $d$-Hitting Set

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Liu, Yuxi, Xiao, Mingyu
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than $3^k$
di: Liu, Yuxi, et al.
Pubblicazione: (2024)

Parameterized Approximation for Capacitated $d$-Hitting Set with Hard Capacities
di: Lokshtanov, Daniel, et al.
Pubblicazione: (2024)

A Simplified Parameterized Algorithm for Directed Feedback Vertex Set
di: Xiong, Ziliang, et al.
Pubblicazione: (2024)

On Fair Epsilon Net and Geometric Hitting Set
di: Dehghankar, Mohsen, et al.
Pubblicazione: (2025)

Faster parameterized algorithm for 3-Hitting Set
di: Tsur, Dekel
Pubblicazione: (2025)

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

Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach
di: Ihalainen, Hannes, et al.
Pubblicazione: (2025)

Protrusion Decompositions Revisited: Uniform Lossy Kernels for Reducing Treewidth and Linear Kernels for Hitting Disconnected Minors
di: Sharma, Roohani, et al.
Pubblicazione: (2026)

Breaking the Barrier $2^k$ for Subset Feedback Vertex Set in Chordal Graphs
di: Bai, Tian, et al.
Pubblicazione: (2022)

An Optimal Algorithm for Half-plane Hitting Set
di: Liu, Gang, et al.
Pubblicazione: (2025)

Minimum-Weight Half-Plane Hitting Set
di: Liu, Gang, et al.
Pubblicazione: (2025)

Enumeration of Minimal Hitting Sets Parameterized by Treewidth
di: Kenig, Batya, et al.
Pubblicazione: (2024)

Faster Parameterized Vertex Multicut
di: Chu, Huairui, et al.
Pubblicazione: (2026)

Knapsack with Vertex Cover, Set Cover, and Hitting Set
di: Dey, Palash, et al.
Pubblicazione: (2024)

Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems
di: Liu, Gang, et al.
Pubblicazione: (2024)

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
di: Bhore, Sujoy, et al.
Pubblicazione: (2026)

Boundaried Kernelization via Representative Sets
di: Antipov, Leonid, et al.
Pubblicazione: (2025)

Estimating Hitting Times Locally At Scale
di: Haris, Themistoklis, et al.
Pubblicazione: (2025)

Latency Guarantees for Caching with Delayed Hits
di: Gurushankar, Keerthana, et al.
Pubblicazione: (2025)

Subexponential Parameterized Algorithms for Hitting Subgraphs
di: Lokshtanov, Daniel, et al.
Pubblicazione: (2024)

Hitting Geodesic Intervals in Structurally Restricted Graphs
di: Gima, Tatsuya, et al.
Pubblicazione: (2025)

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

An Improved Approximation Algorithm for the Capacitated Arc Routing Problem
di: Zhao, Jingyang, et al.
Pubblicazione: (2025)

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

An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling
di: Zhao, Jingyang, et al.
Pubblicazione: (2025)

Approximation Algorithms for the Cumulative Vehicle Routing Problem with Stochastic Demands
di: Zhao, Jingyang, et al.
Pubblicazione: (2025)

The APX-hardness of the Traveling Tournament Problem
di: Zhao, Jingyang, et al.
Pubblicazione: (2023)

Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity
di: Zhao, Jingyang, et al.
Pubblicazione: (2022)

Improved Approximations for Dial-a-Ride Problems
di: Zhao, Jingyang, et al.
Pubblicazione: (2026)

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

Improved Approximations for the Unsplittable Capacitated Vehicle Routing Problem
di: Zhao, Jingyang, et al.
Pubblicazione: (2026)

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

Multidepot Capacitated Vehicle Routing with Improved Approximation Guarantees
di: Zhao, Jingyang, et al.
Pubblicazione: (2023)

Polynomial Kernels with Reachability for Weighted $d$-Matroid Intersection
di: Huang, Chien-Chung, et al.
Pubblicazione: (2026)

An Almost Quadratic Vertex Kernel for Subset Feedback Arc Set in Tournaments
di: Bai, Tian
Pubblicazione: (2025)

How Hard Is It to Rig a Tournament When Few Players Can Beat or Be Beaten by the Favorite?
di: Wang, Zhonghao, et al.
Pubblicazione: (2026)

Parameterized Approximation Algorithms for TSP on Non-Metric Graphs
di: Zhao, Jingyang, et al.
Pubblicazione: (2025)