Some Abstract Pivot Algorithms

DOI10.1137/0129045MaRDI QIDQ4103542zbMATH OpenOpenAlexFDO

Authors Curtis Greene, Thomas L. Magnanti

Publication date 1975

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/5113

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Algorithms in computer science (68W99)

Cited in

(22)

• A unique exchange property for bases
• Intervals in matroid basis graphs
• More on complementary trees
• Bimatroids and invariants
• Applications of matroid partition to tree decomposition
• On maximin share allocations in matroids
• Rainbow and monochromatic circuits and cocircuits in binary matroids
• Interactive optimization of submodular functions under matroid constraints
• A protocol for cutting matroids like cakes
• The Held—Karp algorithm and degree-constrained minimum 1-trees
• Alternating Basis Exchanges in Matroids
• Bounding the payment of approximate truthful mechanisms
• Some Small Circuit-Cocircuit Ramsey Numbers for Matroids
• On sequential basis exchange in matroids
• Approximate maximin share allocations in matroids
• On generalisations of the Aharoni–Pouzet base exchange theorem
• Exchange Distance of Basis Pairs in Split Matroids
• A (1/2+1/60)-approximation algorithm for maximum weight series-parallel subgraph
• Reconfiguration of basis pairs in regular matroids
• Faster matroid partition algorithms
• Better-than-2 approximations for weighted tree augmentation and applications to Steiner tree
• Analysis of the two-for-one swap heuristic for approximating the maximum independent set in a k-polymatroid

This page was built for publication: Some Abstract Pivot Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4103542)