scientific article; zbMATH DE number 1947049

MaRDI QIDQ4411279zbMATH OpenFDO

Authors Benjamin Doerr

Publication date 7 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2462/24620081.htm

zbMATH Keywords

discrepancyroundinggames

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• Typical rounding problems
• On the Computational Complexity of Linear Discrepancy
• STACS 2005
• Roundings respecting hard constraints

Cited in

(9)

• STACS 2005
• Linear discrepancy is _2-hard to approximate
• Typical rounding problems
• On the Computational Complexity of Linear Discrepancy
• Lattice approximation and linear discrepancy of totally unimodular matrices. Extended abstract
• Roundings respecting hard constraints
• Recent progress on combinatorics and algorithms for low discrepancy roundings
• scientific article; zbMATH DE number 1754592 (Why is no real title available?)
• The variance of the discrepancy distribution of rounding procedures, and sums of uniform random variables

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411279)