Simplicial Fermat–Weber Problems Are Dual to Minimum Cost Flow Problems

View at publisher
Authors: Andrei Comăneci
Cited by: 0
References: 27

Fields of Study & Subjects

Polynomial and algebraic computation Data Management and Algorithms Computational Geometry and Mesh Generation

Publication details

Journal / source
Springer proceedings in mathematics & statistics
Pages
33–42
Publication date
1 January 2026
Language
EN