Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/338219.338662acmconferencesArticle/Chapter ViewAbstractPublication PagessodaConference Proceedingsconference-collections
Article
Free access

A new bound for the Carathéodory rank of the bases of a matroid

Published: 01 February 2000 Publication History

Abstract

No abstract available.

References

[1]
C. Bouvier and G. Gonzalez-Sprinberg, G- ddsingularizations de varidtds toriques, Aead. Sci. Paris 315 (1992), 817-820.
[2]
W. Bruns and J . Gubeladze, Normality and covering propreties of aiFme semigroups, Journal fur die Reine und Angewandte Mathematik 510 (1999), 161-178.
[3]
W. Bruns, J. Gubeladze, M. Henk, A. Martin, and R. Weismantel, A counterexample to an integer analogue of Carathdodory's theorem, Journal fur die Reine und Angewandte Mathematik 510 (1999), 179-185.
[4]
W. Cook, J. Fonlupt, and A. Schrijver, An integer analogue of CarathdodmT's theorem, Journal of Combinatorial Theory (B) 40 (1986), 63-70.
[5]
W.H. Cunningham, Testing membership in matroid polyhedra, Journal of Combinatorial Theory (B) 36 (1984), 161-188.
[6]
J. Edmonds, Minimum partition of a matroid into independent subsets, Journal of Research of the National Bureau of Standards 69B (1965), 67-72.
[7]
, Submodular functions, matroids, and certain polyhedra, Combinatorial Structures and Their Applications (New York) (R. Guy, H. Hanani, N. Sauer, and J. Schnheim, eds.), Gordon and Breach, 1970, pp. 69- 87.
[8]
, Matroids and the greedy algorithm, Mathematical Programming 1 (1971), 127-136.
[9]
R.T. Firla and G.M. Ziegler, Hilbert bases, unimodulax triangulations, and binary covers of rational polyhedral cones, Discrete & Computacional Geometry (to appear).
[10]
M. Gr~tschel, L. Lovasz, and A. Schrijver, Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2, Springer, Berlin, 1988.
[11]
C.St.J.A. Nash-Williams, Edge-disjoint spanning trees of finite graphs, Journal of the London Mathmatica Society 36 (1961), 445-450.
[12]
A. Sehrijver, Theory of linear and integer programming, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Chichester, 1986.
[13]
A. Seb~, Hilbert bases, Carathdodory's theorem and combinatorial optimization, Integer Programming and Combinatorial Optimization (R. Kannan and W.R. Pulleyblank, eds.), 1990, pp. 431-455.
[14]
W.T. Tutte, On the problem of decomposing a graph into n connected factors, Journal of the London Mathematical Society (1961), 221-230.

Index Terms

  1. A new bound for the Carathéodory rank of the bases of a matroid

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
      February 2000
      965 pages
      ISBN:0898714532

      Sponsors

      Publisher

      Society for Industrial and Applied Mathematics

      United States

      Publication History

      Published: 01 February 2000

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      Overall Acceptance Rate 411 of 1,322 submissions, 31%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 278
        Total Downloads
      • Downloads (Last 12 months)61
      • Downloads (Last 6 weeks)10
      Reflects downloads up to 27 Dec 2024

      Other Metrics

      Citations

      View Options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Login options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media