Weakly greedy algorithm and pair-delta-matroids

  • Takashi Takabatake
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1120)


Weakly greedy algorithm is an extension of the greedy algorithm. It gives a solution of a combinatorial optimization problem on discrete systems in a properly wider class than the class of Δ-matroids. Discrete systems with a certain 2 to 2 exchangeability belong to this class. We characterize these systems in terms of their rank function. Excluded minors of Δ-matroids and these systems are also described.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Bouchet. Greedy algorithm and symmetric matroids. Mathematical Programming, 38:147–159, 1987.Google Scholar
  2. 2.
    A. Bouchet and W. H. Cunningham. Delta-matroids, jump systems and bisubmodular polyhedra. SIAM journal on Discrete Mathematics, 8:17–32, 1995.CrossRefGoogle Scholar
  3. 3.
    R. Chandrasekaran and S. N. Kabadi. Pseudomatroids. Discrete Mathematics, 71(3):205–217, 1988.CrossRefGoogle Scholar
  4. 4.
    A. Recski. Matroid Theory and its Applications in Electric Network Theory and in Statics. Springer-Verlag, 1989.Google Scholar
  5. 5.
    T. Takabatake. Weakly greedy algorithm, weak-Δ-matroid and its subclasses. Master's thesis, University of Tokyo, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Takashi Takabatake
    • 1
  1. 1.Graduate Division of International and Interdisciplinary StudiesUniversity of TokyoTokyoJapan

Personalised recommendations