scientific article; zbMATH DE number 1947049

zbMATH Open1013.90124MaRDI QIDQ4411279FDOQ4411279

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

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

discrepancyroundinggames

Mathematics Subject Classification ID

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

Cited In (9)

• Linear discrepancy is \(\Pi_2\)-hard to approximate
• On the Computational Complexity of Linear Discrepancy
• Typical rounding problems
• 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
• Title not available (Why is that?)
• The variance of the discrepancy distribution of rounding procedures, and sums of uniform random variables
• STACS 2005

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)