search result

Cover von The Support of Bin Packing Is Exponential

The Support of Bin Packing Is Exponential

Year: 2025
Media group: LIPIcs
Cover von Convolution and Knapsack in Higher Dimensions

Convolution and Knapsack in Higher Dimensions

Year: 2025
Media group: LIPIcs
Cover von A Practical 73/50 Approximation for Contiguous Monotone Moldable Job Scheduling

A Practical 73/50 Approximation for Contiguous Monotone Moldable Job Scheduling

Year: 2026
Media group: LIPIcs
Cover von Approximative Algorithmen und Nichtapproximierbarkeit
Author: Jansen, Klaus; Margraf, Marian Search for this author
Year: 2008
Publisher: Berlin, de Gruyter
Media group: MONOGRAPHIE
Cover von Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows

Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows

Year: 2015
Media group: OASICS
Cover von A Tight Double-Exponential Lower Bound for High-Multiplicity Bin Packing

A Tight Double-Exponential Lower Bound for High-Multiplicity Bin Packing

Year: 2026
Media group: LIPIcs
Cover von Fundamentals of Computation Theory
24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings
Search for this author
Year: 2023
Publisher: Heidelberg, Springer
Series: Lecture notes in computer science; 14292
Media group: MONOGRAPHIE
Cover von Approximation algorithms for combinatorial optimization
international workshop : Aalborg, Denmark, July 18 - 19, 1998 : proceedings
Search for this author
Year: 1998
Publisher: Berlin, Springer
Series: Lecture notes in computer science; 1444
Media group: MONOGRAPHIE
Cover von Closing the Gap for Single Resource Constraint Scheduling

Closing the Gap for Single Resource Constraint Scheduling

Year: 2021
Media group: LIPIcs
Cover von Inapproximability Results for Scheduling with Interval and Resource Restrictions

Inapproximability Results for Scheduling with Interval and Resource Restrictions

Year: 2020
Media group: LIPIcs
OPEN V 11.1.0.0