Approximation and online algorithms for multidimensional bin packing: A survey
The bin packing problem is a well-studied problem in combinatorial optimization. In the
classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to …
classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to …
[图书][B] The probabilistic method
N Alon, JH Spencer - 2016 - books.google.com
Praise for the Third Edition “Researchers of any kind of extremal combinatorics or theoretical
computer science will welcome the new edition of this book.”-MAA Reviews Maintaining a …
computer science will welcome the new edition of this book.”-MAA Reviews Maintaining a …
Mergeable summaries
We study the mergeability of data summaries. Informally speaking, mergeability requires
that, given two summaries on two datasets, there is a way to merge the two summaries into a …
that, given two summaries on two datasets, there is a way to merge the two summaries into a …
Multi-objective mapping for mesh-based NoC architectures
In this paper we present an approach to multi-objective exploration of the mapping space of
a mesh-based network-on-chip architecture. Based on evolutionary computing techniques …
a mesh-based network-on-chip architecture. Based on evolutionary computing techniques …
Smoothed analysis with adaptive adversaries
We prove novel algorithmic guarantees for several online problems in the smoothed
analysis model. In this model, at each time step an adversary chooses an input distribution …
analysis model. In this model, at each time step an adversary chooses an input distribution …
Discrepancy minimization in input-sparsity time
A recent work of Larsen [Lar23] gave a faster combinatorial alternative to Bansal's SDP
algorithm for finding a coloring $ x\in\{-1, 1\}^ n $ that approximately minimizes the …
algorithm for finding a coloring $ x\in\{-1, 1\}^ n $ that approximately minimizes the …
On integer programming, discrepancy, and convolution
K Jansen, L Rohwedder - Mathematics of Operations …, 2023 - pubsonline.informs.org
Integer programs with a fixed number of constraints are solvable in pseudo-polynomial time
in the largest coefficient of any constraint. We give a new algorithm which improves the …
in the largest coefficient of any constraint. We give a new algorithm which improves the …
Algorithms and barriers in the symmetric binary perceptron model
The binary (or Ising) perceptron is a toy model of a single-layer neural network and can be
viewed as a random constraint satisfaction problem with a high degree of connectivity. The …
viewed as a random constraint satisfaction problem with a high degree of connectivity. The …
Discrepancy minimization via a self-balancing walk
We study discrepancy minimization for vectors in ℝ n under various settings. The main result
is the analysis of a new simple random process in high dimensions through a comparison …
is the analysis of a new simple random process in high dimensions through a comparison …
The gram-schmidt walk: a cure for the banaszczyk blues
An important result in discrepancy due to Banaszczyk states that for any set of n vectors in ℝ
m of ℓ2 norm at most 1 and any convex body K in ℝ m of Gaussian measure at least half …
m of ℓ2 norm at most 1 and any convex body K in ℝ m of Gaussian measure at least half …