Imagen de Portada

Equivalent Instances for Scheduling and Packing Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Jansen, Klaus, Kahler, Kai, Wambsganz, Corinna
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity 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

A Tight Double-Exponentially Lower Bound for High-Multiplicity Bin Packing
por: Jansen, Klaus, et al.
Publicado: (2025)

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
por: Jansen, Klaus, et al.
Publicado: (2024)

Generalized Graph Packing Problems Parameterized by Treewidth
por: Esmer, Barış Can, et al.
Publicado: (2025)

Scheduling Problems with Constrained Rejections
por: Davies, Sami, et al.
Publicado: (2025)

Fine-Grained Equivalence for Problems Related to Integer Linear Programming
por: Rohwedder, Lars, et al.
Publicado: (2024)

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

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

Simple approximation algorithms for Polyamorous Scheduling
por: Biktairov, Yuriy, et al.
Publicado: (2024)

The Days On Days Off Scheduling Problem
por: Nießen, Fabien, et al.
Publicado: (2024)

On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
por: S., Karthik C., et al.
Publicado: (2024)

The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
por: Bodlaender, Hans L., et al.
Publicado: (2026)

Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times
por: Balzereit, Kaja, et al.
Publicado: (2024)

Search-space Reduction for Boolean MinCSPs via Essential Constraints
por: Jansen, Bart M. P., et al.
Publicado: (2026)

Characterizing and Testing Principal Minor Equivalence of Matrices
por: Chatterjee, Abhranil, et al.
Publicado: (2024)

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

Improved Hardness of Approximation for Geometric Bin Packing
por: Ray, Arka, et al.
Publicado: (2023)

String Consensus Problems with Swaps and Substitutions
por: Gabory, Estéban, et al.
Publicado: (2025)

Pseudodeterministic Algorithms for Minimum Cut Problems
por: Agarwala, Aryan, et al.
Publicado: (2025)

Neighborhood-Aware Graph Labeling Problem
por: Shahverdikondori, Mohammad, et al.
Publicado: (2026)

Minimizing the Weighted Number of Tardy Jobs is W[1]-hard
por: Heeger, Klaus, et al.
Publicado: (2024)

On the (In)Approximability of the Monitoring Edge Geodetic Set Problem
por: Bilò, Davide, et al.
Publicado: (2025)

Complexity of Local Search for Euclidean Clustering Problems
por: Manthey, Bodo, et al.
Publicado: (2023)

NP-Hardness and a PTAS for the Pinwheel Problem
por: Kleinberg, Robert, et al.
Publicado: (2026)

On the Complexity of Fundamental Problems for DAG-Compressed Graphs
por: Chudigiewitsch, Florian, et al.
Publicado: (2026)

No Price Tags? No Problem: Query Strategies for Unpriced Information
por: Nadimpalli, Shivam, et al.
Publicado: (2025)

An Invitation to "Fine-grained Complexity of NP-Complete Problems"
por: Nederlof, Jesper
Publicado: (2026)

Structural Parameterizations for Two Bounded Degree Problems Revisited
por: Lampis, Michael, et al.
Publicado: (2023)

Equivalent Dichotomies for Triangle Detection in Subgraph, Induced, and Colored H-Free Graphs
por: Abboud, Amir, et al.
Publicado: (2026)

Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
por: Abrahamsen, Mikkel, et al.
Publicado: (2020)

On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
por: Bhaskar, Umang, et al.
Publicado: (2025)

A Complexity Analysis of the c-Closed Vertex Deletion Problem
por: Lehner, Lisa, et al.
Publicado: (2025)

Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
por: Focke, Jacob, et al.
Publicado: (2023)

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand
por: Caragiannis, Ioannis, et al.
Publicado: (2026)

Space Complexity Dichotomies for Subgraph Finding Problems in the Streaming Model
por: Shih, Yu-Sheng, et al.
Publicado: (2026)

Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness
por: Esmer, Barış Can, et al.
Publicado: (2024)

On the parameterized complexity of Broadcast Independence and Broadcast Packing
por: Dumont, Joanne, et al.
Publicado: (2026)

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
por: Herrmann, Anton, et al.
Publicado: (2025)

Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure
por: de Berg, Mark, et al.
Publicado: (2025)

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems
por: Kenig, Batya
Publicado: (2025)

Improved Hardness and Approximations for Cardinality-Based Minimum $s$-$t$ Cuts Problems in Hypergraphs
por: Adriaens, Florian, et al.
Publicado: (2024)