Algorithms - ESA 2003
From MaRDI portal
Publication:5897246
DOI10.1007/b13632zbMath1266.90130OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897246
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
On polynomial kernels for sparse integer linear programs ⋮ Polynomial-time approximation schemes for circle and other packing problems ⋮ High-multiplicity scheduling on one machine with forbidden start and completion times ⋮ Short Presburger Arithmetic Is Hard ⋮ Minimum dimensional Hamming embeddings ⋮ Local Testing of Lattices ⋮ On the bin packing problem with a fixed number of object weights ⋮ Property Testing for Bounded Degree Databases ⋮ Approximation algorithms for a virtual machine allocation problem with finite types ⋮ Fair and efficient allocation with few agent types, few item types, or small value levels ⋮ On the complexity of quasiconvex integer minimization problem ⋮ Enumeration and unimodular equivalence of empty delta-modular simplices ⋮ Helly’s theorem: New variations and applications ⋮ On minimum integer representations of weighted games ⋮ Enumerating Projections of Integer Points in Unbounded Polyhedra ⋮ A quantitative Doignon-Bell-Scarf theorem ⋮ On the complexity of computing Kronecker coefficients ⋮ A linear algorithm for integer programming in the plane ⋮ Optimal routing in double loop networks ⋮ Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization ⋮ Conjugacy and Other Properties of One-Relator Groups ⋮ Optimal edge-coloring with edge rate constraints ⋮ FPT-algorithm for computing the width of a simplex given by a convex hull ⋮ Techniques and results on approximation algorithms for packing circles ⋮ An asymptotically exact algorithm for the high-multiplicity bin packing problem
This page was built for publication: Algorithms - ESA 2003
