Momentopes, the complexity of vector partitioning, and Davenport-Schinzel sequences

DOI10.1007/s00454-001-0069-0zbMath1010.68193OpenAlexW2047629801MaRDI QIDQ1597685

Shmuel Onn, Sharon Aviran

Publication date: 30 May 2002

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-001-0069-0

zbMATH Keywords

partition problemmomentopes

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

A note on the minimum number of edge-directions of a convex polytope ⋮ Screening multi‐dimensional heterogeneous populations for infectious diseases under scarce testing resources, with application to <scp>COVID</scp>‐19

This page was built for publication: Momentopes, the complexity of vector partitioning, and Davenport-Schinzel sequences