Image de couverture de livre

APTAS for bin packing with general cost structures

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Jaykrishnan, G., Levin, Asaf
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Discrete Mathematics Optimization and Control 68W25 F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
par: Sun, Hao
Publié: (2023)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
par: Hougardy, Stefan, et autres
Publié: (2025)

Searching in trees with monotonic query times
par: Dereniowski, Dariusz, et autres
Publié: (2024)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
par: Zhong, Xianghui
Publié: (2019)

Fairness in the k-Server Problem
par: Daneshvaramoli, Mohammadreza, et autres
Publié: (2025)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
par: Heimann, Sophia, et autres
Publié: (2025)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
par: Heimann, Sophia, et autres
Publié: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
par: Hougardy, Stefan, et autres
Publié: (2024)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
par: Buchbinder, Niv, et autres
Publié: (2024)

Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications
par: Bonnet, Édouard, et autres
Publié: (2026)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
par: Feldman, Moran, et autres
Publié: (2026)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
par: Filmus, Yuval, et autres
Publié: (2024)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
par: An, Hyung-Chan, et autres
Publié: (2025)

Pliability and Approximating Max-CSPs
par: Romero, Miguel, et autres
Publié: (2019)

Bicriteria Submodular Maximization
par: Feldman, Moran, et autres
Publié: (2025)

Interval Graphs are Reconstructible
par: Heinrich, Irene, et autres
Publié: (2025)

Answering Related Questions
par: Bonnet, Édouard
Publié: (2025)

Coloring Hardness on Low Twin-Width Graphs
par: Bonnet, Édouard
Publié: (2025)

Dynamic Traffic Assignment for Public Transport with Vehicle Capacities
par: Patzner, Julian, et autres
Publié: (2024)

Minimum-cost paths for electric cars
par: Dorfman, Dani, et autres
Publié: (2024)

An $11/6$-Approximation Algorithm for Vertex Cover on String Graphs
par: Bonnet, Édouard, et autres
Publié: (2024)

IID Prophet Inequality with Random Horizon: Going Beyond Increasing Hazard Rates
par: Giambartolomei, Giordano, et autres
Publié: (2024)

Prophet Inequalities: Separating Random Order from Order Selection
par: Giambartolomei, Giordano, et autres
Publié: (2023)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
par: DasGupta, Bhaskar, et autres
Publié: (2026)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
par: Mundhra, S.
Publié: (2025)

Sublinear-Time Computation in the Presence of Online Erasures
par: Kalemaj, Iden, et autres
Publié: (2021)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
par: Michel, Stefan
Publié: (2025)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
par: Rockel-Wolff, Benjamin
Publié: (2024)

On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
par: Laekhanukit, Bundit
Publié: (2024)

On Finding Randomly Planted Cliques in Arbitrary Graphs
par: Agrimonti, Francesco, et autres
Publié: (2025)

An asymptotically optimal algorithm for generating bin cardinalities
par: Devroye, Luc, et autres
Publié: (2024)

Amnesiac Flooding: Easy to break, hard to escape
par: Austin, Henry, et autres
Publié: (2025)

Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
par: Komusiewicz, Christian, et autres
Publié: (2023)

Computing parameters that generalize interval graphs using restricted modular partitions
par: Bonomo-Braberman, Flavia, et autres
Publié: (2025)

Supermodular Maximization with Cardinality Constraints
par: Chen, Xujin, et autres
Publié: (2025)

Faster algorithms on linear delta-matroids
par: Koana, Tomohiro, et autres
Publié: (2024)

A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
par: Jacob, Ashwin, et autres
Publié: (2026)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
par: Buchbinder, Niv, et autres
Publié: (2024)

Robust Permutation Flowshops Under Budgeted Uncertainty
par: Goldberg, Noam, et autres
Publié: (2026)

The Power of Filling in Balanced Allocations
par: Los, Dimitrios, et autres
Publié: (2022)