Conference paper
Efficient algorithms for the hitchcock transportation problem
Takeshi Tokuyama, Jun Nakano
SODA 1992
It is known that for simple arrangements in the d-dimensional Euclidean space RdThe average number of j-dimensional subfaces of a k-dimensional face is less than {Mathematical expression}. In this paper, we show that this is also true for all arrangements in Rd and for all oriented matroids, and we give combinatorial proofs. © 1993 Kluwer Academic Publishers.
Takeshi Tokuyama, Jun Nakano
SODA 1992
Tomio Hirata, Jiří Matoušek, et al.
Computational Geometry: Theory and Applications
Shu Tezuka, Takeshi Tokuyama
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Alok Aggarwal, Takeshi Tokuyama
Discrete Applied Mathematics