Approximation-Friendly Discrepancy Rounding (Q3186517): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On tail probabilities for martingales / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Constructive Discrepancy Minimization for Convex Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank | |||
Normal rank |
Latest revision as of 06:06, 15 July 2024
scientific article; zbMATH DE number 6843441
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximation-Friendly Discrepancy Rounding |
scientific article; zbMATH DE number 6843441 |
Statements
Approximation-Friendly Discrepancy Rounding (English)
0 references
10 August 2016
0 references
26 February 2018
0 references
discrepancy-based rounding algorithm
0 references
combinatorial structure
0 references
0 references