Submodular Functions, Matroids, and Certain Polyhedra

2003/01/01 by Jack Edmonds · 7 citations
Computer Science · Mathematics · #Abstraction #Advanced Algebra and Logic #Algebra over a field #Algebraic number #Axiom #Cardinality (data modeling) #Combinatorics #Computer science #Geometry #Mathematics #Matroid #Oracle #Polyhedron #Programming language #Pure mathematics #Submodular set function #Van der Waerden's theorem

paper · doi:10.1007/3-540-36478-1_2

crossref issued 2003/01/01 · crossref published 2003/01/01 · crossref published-print 2003/01/01 · openalex publication_date 2003/01/01 · crossref published-online 2003/01/30 · crossref created 2007/10/20 · crossref deposited 2019/05/03 · openalex created_date 2025/10/10 · crossref indexed 2026/08/04 · openalex updated_date 2026/08/04

Citations

• On the shortest spanning subtree of a graph and the traveling salesman problem

Cited by

• Real-Time AI Service Economy: A Framework for Agentic Computing Across the Continuum
• Convex Analysis and Optimization with Submodular Functions: a Tutorial
• Solving Steiner trees: Recent advances, challenges, and perspectives
• Expected cost in Combinatorial Optimization under color constraints
• Ehrhart Polynomials of Matroid Polytopes and Polymatroids
• Limit for Quotient Convergent Graph Sequence
• Matroid [wikipedia]