Building fences straight and high: an optimal algorithm for finding the maximum length you can cut \(k\) times from given sticks (Q1755749)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Building fences straight and high: an optimal algorithm for finding the maximum length you can cut k times from given sticks |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Building fences straight and high: an optimal algorithm for finding the maximum length you can cut \(k\) times from given sticks |
scientific article |
Statements
Building fences straight and high: an optimal algorithm for finding the maximum length you can cut \(k\) times from given sticks (English)
0 references
11 January 2019
0 references
envy-free stick division
0 references
envy-free allocations
0 references
fair division
0 references
building fences
0 references
stick cutting
0 references
cake cutting with waste
0 references
proportional apportionment
0 references
0 references
0.7868731021881104
0 references
0.7688100337982178
0 references
0.756238579750061
0 references
0.7430506944656372
0 references
