Pages that link to "Item:Q1079135"

The following pages link to Scaling algorithms for network problems (Q1079135):

Displaying 39 items.

• Optimum matchings in weighted bipartite graphs (Q265439) (← links)
• A fast cost scaling algorithm for submodular flow (Q294751) (← links)
• An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem (Q442108) (← links)
• A simple reduction from maximum weight matching to maximum cardinality matching (Q456169) (← links)
• An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem (Q651729) (← links)
• A scaling technique for finding the weighted analytic center of a polytope (Q687084) (← links)
• Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
• A linear time algorithm for the maximum capacity path problem (Q809905) (← links)
• The maximum flow problem: A max-preflow approach (Q811325) (← links)
• A parallel algorithm for eliminating cycles in undirected graphs (Q910243) (← links)
• Generating pseudo-random permutations and maximum flow algorithms (Q915489) (← links)
• Single source shortest paths in \(H\)-minor free graphs (Q986535) (← links)
• Maximum weight bipartite matching in matrix multiplication time (Q1035683) (← links)
• River routing in VLSI (Q1102106) (← links)
• On graphs preserving rectilinear shortest paths in the presence of obstacles (Q1179762) (← links)
• Finding minimum-cost flows by double scaling (Q1184348) (← links)
• On the computational behavior of a polynomial-time network flow algorithm (Q1190598) (← links)
• Computational investigations of maximum flow algorithms (Q1278652) (← links)
• Test sets of integer programs (Q1298753) (← links)
• Lexicographic bottleneck combinatorial problems (Q1306468) (← links)
• Parallel algorithms for the assignment and minimum-cost flow problems (Q1319670) (← links)
• On the exponent of all pairs shortest path problem (Q1356884) (← links)
• Minimum-cost flows in unit-capacity networks (Q1693987) (← links)
• Critical objective function values in linear sum assignment problems (Q1743488) (← links)
• A generalization of the scaling max-flow algorithm (Q1885993) (← links)
• A new scaling algorithm for the minimum cost network flow problem (Q1970413) (← links)
• Short simplex paths in lattice polytopes (Q2117352) (← links)
• Weighted approximate parameterized string matching (Q2409763) (← links)
• A faster strongly polynomial time algorithm to solve the minimum cost tension problem (Q2410039) (← links)
• An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem (Q2424659) (← links)
• The symbolic algorithms for maximum flow in networks (Q2433386) (← links)
• Bi-criteria and approximation algorithms for restricted matchings (Q2453169) (← links)
• Minimax inverse problems of minimum cuts (Q2782726) (← links)
• Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem (Q2815443) (← links)
• A feasibility evaluation approach for time-evolving multi-item production–distribution networks (Q2815546) (← links)
• Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
• AO(nm log(U/n)) time maximum flow algorithm (Q4519920) (← links)
• Recent developments in maximum flow algorithms (Q5054836) (← links)
• A Filtering Technique for All Pairs Approximate Parameterized String Matching (Q5114858) (← links)