Imagen de Portada

Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Fujiwara, Hiroshi, Atsumi, Rina, Yamamoto, Hiroaki
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Discrete Mathematics Combinatorics Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Vertex-ordering and arc-partitioning problems
por: Borsik, Nóra A., et al.
Publicado: (2025)

Separable convex optimization over indegree polytopes
por: Borsik, Nóra A., et al.
Publicado: (2025)

Prefix-bounded matrices
por: Borsik, Nóra A., et al.
Publicado: (2025)

Integer programs with bounded subdeterminants and two nonzeros per row
por: Fiorini, Samuel, et al.
Publicado: (2021)

On the Congruency-Constrained Matroid Base
por: Liu, Siyue, et al.
Publicado: (2023)

Complexity of polytope diameters via perfect matchings
por: Nöbel, Christian, et al.
Publicado: (2024)

Integer programs with nearly totally unimodular matrices: the cographic case
por: Aprile, Manuel, et al.
Publicado: (2024)

Totally $Δ$-modular IPs with two non-zeros in most rows
por: Kober, Stefan
Publicado: (2024)

Total Matching and Subdeterminants
por: Ferrarini, Luca, et al.
Publicado: (2023)

Algorithmic aspects of semistability of quiver representations
por: Iwamasa, Yuni, et al.
Publicado: (2024)

A Primal-Dual Extension of the Goemans--Williamson Algorithm for the Weighted Fractional Cut-Covering Problem
por: Proença, Nathan Benedetto, et al.
Publicado: (2023)

A Θ(m^9) ternary minimum-cost network flow LP model of the Assignment Problem polytope with applications to hard combinatorial optimization problems
por: Diaby, Moustapha
Publicado: (2016)

A Faster Deterministic Algorithm for Mader's $\mathcal{S}$-Path Packing
por: Iwata, Satoru, et al.
Publicado: (2024)

Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack
por: Schade, Jamico, et al.
Publicado: (2023)

Efficient approximation schemes for scheduling on a stochastic number of machines
por: Epstein, Leah, et al.
Publicado: (2024)

NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability
por: Kar, Prem Nigam, et al.
Publicado: (2024)

EPTAS for Hard Graph Cut Problems for Dense Graphs
por: Deguchi, Kaisei, et al.
Publicado: (2026)

Generalized Cuts and Grothendieck Covers: a Primal-Dual Approximation Framework Extending the Goemans--Williamson Algorithm
por: Proença, Nathan Benedetto, et al.
Publicado: (2024)

The Central Spanning Tree Problem
por: Sanmartín, Enrique Fita, et al.
Publicado: (2024)

Reconfiguration of Multisets with Applications to Bin Packing
por: Kam, Jeffrey, et al.
Publicado: (2024)

A 1/2-Approximation for Budgeted $k$-Submodular Maximization
por: Wang, Chenhao
Publicado: (2025)

A Tie-breaking based Local Search Algorithm for Stable Matching Problems
por: Qiu, Junyuan
Publicado: (2024)

Min-Max Connected Multiway Cut
por: Tiwary, Hans Raj, et al.
Publicado: (2026)

Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics
por: Ameli, Afrouz Jabal, et al.
Publicado: (2026)

Space Efficient Algorithms for Parameterised Problems
por: Akhtar, Sheikh Shakil, et al.
Publicado: (2025)

ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization
por: Gallart, Joan Vendrell, et al.
Publicado: (2025)

Multiplicative assignment with upgrades
por: Armbruster, Alexander, et al.
Publicado: (2025)

Flow Shop Scheduling with Stochastic Reentry
por: von Aspern, Maximilian, et al.
Publicado: (2026)

New Sequence-Independent Lifting Techniques for Cutting Planes and When They Induce Facets
por: Prasad, Siddharth, et al.
Publicado: (2024)

Efficient Local and Tabu Search Strategies for Large-Scale Quadratic Integer Programming
por: Wang, Haibo, et al.
Publicado: (2024)

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
por: Majewski, Konrad, et al.
Publicado: (2022)

An Improved Bound for the Beck-Fiala Conjecture
por: Bansal, Nikhil, et al.
Publicado: (2025)

Tight Bounds for Sparsifying Random CSPs
por: Brakensiek, Joshua, et al.
Publicado: (2025)

Bounding Width on Graph Classes of Constant Diameter
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

The Strong Birthday Problem Revisited
por: Tripathy, Chijul B.
Publicado: (2025)

Circulant TSP: Vertices of the Edge-Length Polytope and Superpolynomial Lower Bounds
por: Gutekunst, Samuel C.
Publicado: (2025)

Problems on Group-labeled Matroid Bases
por: Hörsch, Florian, et al.
Publicado: (2024)

On The Maximum Linear Arrangement Problem for Trees
por: Alemany-Puig, Lluís, et al.
Publicado: (2023)

An Algebraic Approach to the Longest Path Problem
por: Khazali, Omar Al -
Publicado: (2023)

Hardness of Burning Number Problem on Regular Graphs
por: Antony, Dhanyamol, et al.
Publicado: (2026)