Algorithms - ESA 2003

From MaRDI portal
Publication:5897246

DOI10.1007/b13632zbMath1266.90130OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897246

Friedrich Eisenbrand

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




Related Items

On polynomial kernels for sparse integer linear programsPolynomial-time approximation schemes for circle and other packing problemsHigh-multiplicity scheduling on one machine with forbidden start and completion timesShort Presburger Arithmetic Is HardMinimum dimensional Hamming embeddingsLocal Testing of LatticesOn the bin packing problem with a fixed number of object weightsProperty Testing for Bounded Degree DatabasesApproximation algorithms for a virtual machine allocation problem with finite typesFair and efficient allocation with few agent types, few item types, or small value levelsOn the complexity of quasiconvex integer minimization problemEnumeration and unimodular equivalence of empty delta-modular simplicesHelly’s theorem: New variations and applicationsOn minimum integer representations of weighted gamesEnumerating Projections of Integer Points in Unbounded PolyhedraA quantitative Doignon-Bell-Scarf theoremOn the complexity of computing Kronecker coefficientsA linear algorithm for integer programming in the planeOptimal routing in double loop networksBeyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimizationConjugacy and Other Properties of One-Relator GroupsOptimal edge-coloring with edge rate constraintsFPT-algorithm for computing the width of a simplex given by a convex hullTechniques and results on approximation algorithms for packing circlesAn asymptotically exact algorithm for the high-multiplicity bin packing problem




This page was built for publication: Algorithms - ESA 2003