Fast algorithms via dynamic-oracle matroids

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Making data structures persistent
Forests, frames, and games: Algorithms for matroid sums and applications
Edge-disjoint spanning trees and depth-first search
Random sampling and greedy sparsification for matroid optimization problems
Combinatorial optimization. Polyhedra and efficiency (3 volumes)
A matroid approach to finding edge connectivity and packing arborescences
Applications of Menger's graph theorem
Maintaining α-balanced trees by partial rebuilding
A Constructive Arboricity Approximation Scheme
Algebraic Algorithms for Matching and Matroid Problems
Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
Improved Bounds for Matroid Partition and Intersection Algorithms
Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems
The Union of Matroids and the Rigidity of Frameworks
Matroid intersection algorithms
Sparsification—a technique for speeding up dynamic graph algorithms
Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m^10/7 log W) Time (Extended Abstract)
Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n^{1/2 - ε})-time
Fully-dynamic minimum spanning forest with improved worst-case update time
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
Unit Capacity Maxflow in Almost $m^{4/3}$ Time
Weighted min-cut: sequential, cut-query, and streaming algorithms
An improved cutting plane method for convex optimization, convex-concave games, and its applications
Transversals and matroid partition
Matching Theory for Combinatorial Geometries
On a Class of Matroids Arising From Paths in Graphs
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Dynamic graph connectivity in polylogarithmic worst case time
Vertex connectivity in poly-logarithmic max-flows
Breaking the quadratic barrier for matroid intersection
Minimum cost flows, MDPs, and ℓ ₁ -regression in nearly linear time for dense instances
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition
On the cut dimension of a graph

This page was built for publication: Fast algorithms via dynamic-oracle matroids