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

DOI10.1007/S00454-001-0069-0MaRDI QIDQ1597685zbMATH OpenOpenAlexFDO

Authors Sharon Aviran, Shmuel Onn

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

momentopespartition problem

Mathematics Subject Classification ID

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

Recommendations

• The complexity of vector partition
• On the complexity of some partition problems
• The vectorization of the partition problem
• scientific article; zbMATH DE number 3252232
• Vector partitions, multi-dimensional Faà di Bruno formulae and generating algorithms
• On the computational complexity of (O,P)-partition problems
• On complexity of some problems of cluster analysis of vector sequences
• Computing and Combinatorics
• On factor complexity of morphic sequences
• Chop vectors and the lattice of integer partitions

Cited in

(6)

• The complexity of vector partition
• The vector partition problem for convex objective functions.
• On the vertex characterization of single-shape partition polytopes
• Query complexity of sampling and small geometric partitions
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1597685)