Pages that link to "Item:Q4729348"
From MaRDI portal
The following pages link to Faster Scaling Algorithms for Network Problems (Q4729348):
Displaying 50 items.
- Optimum matchings in weighted bipartite graphs (Q265439) (← links)
- Fair matchings and related problems (Q270032) (← links)
- Edge-chromatic sum of trees and bounded cyclicity graphs (Q294800) (← links)
- A simple reduction from maximum weight matching to maximum cardinality matching (Q456169) (← links)
- Weighted matching as a generic pruning technique applied to optimization constraints (Q490152) (← links)
- An efficient scaling algorithm for the minimum weight bibranching problem (Q652532) (← links)
- A cost-scaling algorithm for \(0-1\) submodular flows (Q678855) (← links)
- How to allocate review tasks for robust ranking (Q707596) (← links)
- Quantum algorithms for matching problems (Q839634) (← links)
- Improved algorithm for the symmetry number problem on trees (Q844174) (← links)
- An improved Dijkstra's shortest path algorithm for sparse network (Q870157) (← links)
- Computing the inertia from sign patterns (Q877192) (← links)
- Solving linear programs from sign patterns (Q927161) (← links)
- Using combinatorial optimization in model-based trimmed clustering with cardinality constraints (Q962299) (← links)
- Single source shortest paths in \(H\)-minor free graphs (Q986535) (← links)
- Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
- Approximate labelled subtree homeomorphism (Q1018101) (← links)
- Stable marriage with ties and bounded length preference lists (Q1026229) (← links)
- Maximum weight bipartite matching in matrix multiplication time (Q1035683) (← links)
- Dual coordinate step methods for linear network flow problems (Q1115790) (← links)
- Finding minimum-cost flows by double scaling (Q1184348) (← links)
- The algorithmic complexity of colour switching (Q1199936) (← links)
- Kaikoura tree theorems: Computing the maximum agreement subtree (Q1313765) (← links)
- Parallel algorithms for the assignment and minimum-cost flow problems (Q1319670) (← links)
- The symmetry number problem for trees (Q1603439) (← links)
- A fast scaling algorithm for the weighted triangle-free 2-matching problem (Q1678085) (← links)
- Minimum-cost flows in unit-capacity networks (Q1693987) (← links)
- Improving man-optimal stable matchings by minimum change of preference lists (Q1736562) (← links)
- Mathematical models for stable matching problems with ties and incomplete lists (Q1737478) (← links)
- A faster polynomial algorithm for the constrained maximum flow problem (Q1761207) (← links)
- MuRoCo: a framework for capability- and situation-aware coalition formation in cooperative multi-robot systems (Q1761253) (← links)
- Combinatorics and algorithms for low-discrepancy roundings of a real sequence (Q1770423) (← links)
- An improved upper bound on the expected regret of UCB-type policies for a matching-selection bandit problem (Q1785430) (← links)
- A new approach to all-pairs shortest paths on real-weighted graphs (Q1884872) (← links)
- Using geometry to solve the transportation problem in the plane (Q1894300) (← links)
- An efficient cost scaling algorithm for the assignment problem (Q1914072) (← links)
- Algorithms for dense graphs and networks on the random access computer (Q1918989) (← links)
- Shortest paths algorithms: Theory and experimental evaluation (Q1919099) (← links)
- Upper and lower degree-constrained graph orientation with minimum penalty (Q2062132) (← links)
- On universally consistent and fully distribution-free rank tests of vector independence (Q2091822) (← links)
- The assignment problem revisited (Q2136890) (← links)
- Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers (Q2149100) (← links)
- Optimal transport: discretization and algorithms (Q2235779) (← links)
- Exact and approximation algorithms for weighted matroid intersection (Q2316615) (← links)
- Generalized LCS (Q2378524) (← links)
- A network flow algorithm for reconstructing binary images from discrete X-rays (Q2384105) (← links)
- Algorithms for solving the symmetry number problem on trees (Q2390304) (← links)
- A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching (Q2390325) (← links)
- Solving all-pairs shortest path by single-source computations: theory and practice (Q2403799) (← links)
- Weighted approximate parameterized string matching (Q2409763) (← links)
