Login / Signup

Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders.

Hiroshi ImaiSatoru IwataKyoko SekineKensyu Yoshida
Published in: COCOON (1996)
Keyphrases
  • partial order
  • partially ordered
  • computational geometry
  • vertex cover
  • optimization problems
  • theoretical guarantees
  • convex quadratic programming
  • data mining
  • multi dimensional
  • np complete
  • total order