scientific article

From MaRDI portal

Revision as of 14:31, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2768281

Jump to:navigation, search

zbMath1018.90026MaRDI QIDQ2768281

Benjamin Doerr

Publication date: 15 September 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

worst-case linear discrepancy linear programming approach hereditary discrepancy lattice approximation problem

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27) Complexity and performance of numerical algorithms (65Y20)

Related Items (6)

The structure and number of global roundings of a graph ⋮ Typical rounding problems ⋮ Recent progress on combinatorics and algorithms for low discrepancy roundings ⋮ \(L_{p}\) linear discrepancy of totally unimodular matrices ⋮ Set-Codes with Small Intersections and Small Discrepancies ⋮ Unimodular hypergraph for DNA sequencing: a polynomial time algorithm

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2768281&oldid=15645118"