The following pages link to Some Abstract Pivot Algorithms (Q4103542):
Displaying 18 items.
- Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
- A unique exchange property for bases (Q1151402) (← links)
- Intervals in matroid basis graphs (Q1213450) (← links)
- More on complementary trees (Q1229877) (← links)
- Bimatroids and invariants (Q1254324) (← links)
- Applications of matroid partition to tree decomposition (Q1568255) (← links)
- On maximin share allocations in matroids (Q1628590) (← links)
- Rainbow and monochromatic circuits and cocircuits in binary matroids (Q2124622) (← links)
- Interactive optimization of submodular functions under matroid constraints (Q2695451) (← links)
- A Protocol for Cutting Matroids Like Cakes (Q2937759) (← links)
- The Held—Karp algorithm and degree-constrained minimum 1-trees (Q4168404) (← links)
- Alternating Basis Exchanges in Matroids (Q4182767) (← links)
- Some Small Circuit-Cocircuit Ramsey Numbers for Matroids (Q4844491) (← links)
- On Sequential Basis Exchange in Matroids (Q5163514) (← links)
- Approximate Maximin Share Allocations in Matroids (Q5283377) (← links)
- On generalisations of the Aharoni–Pouzet base exchange theorem (Q6096802) (← links)
- Exchange Distance of Basis Pairs in Split Matroids (Q6187077) (← links)
- A \((1/2+1/60)\)-approximation algorithm for maximum weight series-parallel subgraph (Q6558687) (← links)