The Greedy Algorithm and the Cohen-Macaulay Property of Rings, Graphs and Toric Projective Curves
From MaRDI portal
Publication:4613702
DOI10.1007/978-3-319-96827-8_17zbMath1405.14136OpenAlexW2890552499MaRDI QIDQ4613702
Publication date: 24 January 2019
Published in: Singularities, Algebraic Geometry, Commutative Algebra, and Related Topics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/129870
Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Computational aspects of algebraic curves (14Q05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the hardness of approximating minimum vertex cover
- Shellable graphs and sequentially Cohen-Macaulay bipartite graphs
- Optimal bounds for the change-making problem
- Cohen-Macaulay graphs
- Combinatorics and commutative algebra.
- Syzygies of affine toric varieties
- Incidence matrices and interval graphs
- COIN EXCHANGE ALGORITHMS AND TORIC PROJECTIVE CURVES
- Greedoids and Linear Objective Functions
- Edgewise strongly shellable clutters
- Shellable Nonpure Complexes and Posets. I
- Strong shellability of simplicial complexes
- Matroids and the greedy algorithm