Image de couverture de livre

Hitting Meets Packing: How Hard Can it Be?

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Focke, Jacob, Frei, Fabian, Li, Shaohua, Marx, Dániel, Schepper, Philipp, Sharma, Roohani, Węgrzycki, Karol
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
par: Focke, Jacob, et autres
Publié: (2023)

Tight (S)ETH-based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-Machine Scheduling
par: Bringmann, Karl, et autres
Publié: (2026)

Protrusion Decompositions Revisited: Uniform Lossy Kernels for Reducing Treewidth and Linear Kernels for Hitting Disconnected Minors
par: Sharma, Roohani, et autres
Publié: (2026)

Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness
par: Esmer, Barış Can, et autres
Publié: (2024)

Space-Efficient Algorithm for Integer Programming with Few Constraints
par: Rohwedder, Lars, et autres
Publié: (2024)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
par: Focke, Jacob, et autres
Publié: (2022)

On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
par: Bhore, Sujoy, et autres
Publié: (2025)

Beating Meet-in-the-Middle for Subset Balancing Problems
par: Randolph, Tim, et autres
Publié: (2025)

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems
par: Eisenbrand, Friedrich, et autres
Publié: (2024)

Faster algorithms for k-Orthogonal Vectors in low dimension
par: Dürr, Anita, et autres
Publié: (2025)

Improving Lagarias-Odlyzko Algorithm For Average-Case Subset Sum: Modular Arithmetic Approach
par: Joux, Antoine, et autres
Publié: (2024)

Fine-Grained Equivalence for Problems Related to Integer Linear Programming
par: Rohwedder, Lars, et autres
Publié: (2024)

List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
par: Esmer, Barış Can, et autres
Publié: (2022)

Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime
par: Aggarwal, Divesh, et autres
Publié: (2024)

Parameterized Approximation for Capacitated $d$-Hitting Set with Hard Capacities
par: Lokshtanov, Daniel, et autres
Publié: (2024)

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search
par: Esmer, Barış Can, et autres
Publié: (2022)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
par: Randolph, Tim, et autres
Publié: (2024)

Approximations and Hardness of Packing Partially Ordered Items
par: Doron-Arad, Ilan, et autres
Publié: (2024)

Hardness and Tight Approximations of Demand Strip Packing
par: Jansen, Klaus, et autres
Publié: (2024)

A Dividing Line for Structural Kernelization of Component Order Connectivity via Distance to Bounded Pathwidth
par: Greilhuber, Jakob, et autres
Publié: (2026)

Generalized Graph Packing Problems Parameterized by Treewidth
par: Esmer, Barış Can, et autres
Publié: (2025)

Estimating Hitting Times Locally At Scale
par: Haris, Themistoklis, et autres
Publié: (2025)

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
par: Kisfaludi-Bak, Sándor, et autres
Publié: (2020)

Dynamic data structures for twin-ordered matrices
par: Bosek, Bartłomiej, et autres
Publié: (2026)

On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms
par: Albers, Susanne, et autres
Publié: (2025)

From Chinese Postman to Salesman and Beyond I: Approximating Shortest Tours $δ$-Covering All Points on All Edges
par: Frei, Fabian, et autres
Publié: (2024)

From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity
par: Frei, Fabian, et autres
Publié: (2025)

Subexponential Parameterized Algorithms for Hitting Subgraphs
par: Lokshtanov, Daniel, et autres
Publié: (2024)

Automating the Search for Small Hard Examples to Approximation Algorithms
par: Sharma, Eklavya
Publié: (2025)

Latency Guarantees for Caching with Delayed Hits
par: Gurushankar, Keerthana, et autres
Publié: (2025)

Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
par: Hatzel, Meike, et autres
Publié: (2022)

Residue Domination in Bounded-Treewidth Graphs
par: Greilhuber, Jakob, et autres
Publié: (2024)

A Refined Kernel for $d$-Hitting Set
par: Liu, Yuxi, et autres
Publié: (2025)

Hitting Geodesic Intervals in Structurally Restricted Graphs
par: Gima, Tatsuya, et autres
Publié: (2025)

On Fair Epsilon Net and Geometric Hitting Set
par: Dehghankar, Mohsen, et autres
Publié: (2025)

Faster parameterized algorithm for 3-Hitting Set
par: Tsur, Dekel
Publié: (2025)

Time-Optimal $k$-Server
par: Frei, Fabian, et autres
Publié: (2025)

Metric Dimension and Geodetic Set Parameterized by Vertex Cover
par: Foucaud, Florent, et autres
Publié: (2024)

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
par: Foucaud, Florent, et autres
Publié: (2023)

Packing Short Cycles
par: Bentert, Matthias, et autres
Publié: (2024)