Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints

DOI10.1007/978-3-031-20624-5_13OpenAlexW4312375455MaRDI QIDQ6109005

Waldo Gálvez, Víctor Verdugo

Publication date: 26 July 2023

Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-20624-5_13

zbMATH Keywords

approximation algorithmsdiversitypacking problems

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling malleable tasks with precedence constraints
• Vector bin packing with multiple-choice
• Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
• Improved online algorithms for Knapsack and GAP in the random order model
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Approximation and online algorithms for multidimensional bin packing: a survey
• Parameterized Approximation Scheme for the Multiple Knapsack Problem
• A Note on Approximation Schemes for Multidimensional Knapsack Problems
• Fast Approximation Algorithms for Knapsack Problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Approximate Algorithms for the 0/1 Knapsack Problem
• Reducibility among Combinatorial Problems
• Approximating Geometric Knapsack via L-packings
• A Technique for Obtaining True Approximations for k-Center with Covering Constraints
• Fair Colorful k-Center Clustering
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• Measurement of Diversity
• LATIN 2004: Theoretical Informatics

This page was built for publication: Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints