Faster Scaling Algorithms for Network Problems
From MaRDI portal
Publication:4729348
Recommendations
Cited in
(only showing first 100 items - show all)- Approximate labelled subtree homeomorphism
- Stable marriage with ties and bounded length preference lists
- Maximum weight bipartite matching in matrix multiplication time
- An out-of-kilter method for the algebraic circulation problem
- Scaling algorithms for network problems
- Dual coordinate step methods for linear network flow problems
- Finding minimum-cost flows by double scaling
- New scaling algorithms for the assignment and minimum mean cycle problems
- The algorithmic complexity of colour switching
- Kaikoura tree theorems: Computing the maximum agreement subtree
- Parallel algorithms for the assignment and minimum-cost flow problems
- The symmetry number problem for trees
- A fast scaling algorithm for the weighted triangle-free 2-matching problem
- Minimum-cost flows in unit-capacity networks
- Improving man-optimal stable matchings by minimum change of preference lists
- Mathematical models for stable matching problems with ties and incomplete lists
- A faster polynomial algorithm for the constrained maximum flow problem
- MuRoCo: a framework for capability- and situation-aware coalition formation in cooperative multi-robot systems
- Combinatorics and algorithms for low-discrepancy roundings of a real sequence
- An improved upper bound on the expected regret of UCB-type policies for a matching-selection bandit problem
- A new approach to all-pairs shortest paths on real-weighted graphs
- Using geometry to solve the transportation problem in the plane
- An efficient cost scaling algorithm for the assignment problem
- Algorithms for dense graphs and networks on the random access computer
- Shortest paths algorithms: Theory and experimental evaluation
- Upper and lower degree-constrained graph orientation with minimum penalty
- On universally consistent and fully distribution-free rank tests of vector independence
- The assignment problem revisited
- Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers
- Optimal transport: discretization and algorithms
- Exact and approximation algorithms for weighted matroid intersection
- Generalized LCS
- A network flow algorithm for reconstructing binary images from discrete X-rays
- Algorithms for solving the symmetry number problem on trees
- A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching
- Solving all-pairs shortest path by single-source computations: theory and practice
- Weighted approximate parameterized string matching
- Reducing rank-maximal to maximum weight matching
- Planar graphs, negative weight edges, shortest paths, and near linear time
- Temporal stratification tests for linear and branching-time deductive databases
- Optimum matchings in weighted bipartite graphs
- Fair matchings and related problems
- Faster algorithms for semi-matching problems
- Tractable and intractable variations of unordered tree edit distance
- Minimum-cost flow algorithms: an experimental evaluation
- Edge-chromatic sum of trees and bounded cyclicity graphs
- Minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest paths
- Near approximation of maximum weight matching through efficient weight reduction
- scientific article; zbMATH DE number 437547 (Why is no real title available?)
- Linear-time approximation for maximum weight matching
- Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems
- Optimal Partial Tiling of Manhattan Polyominoes
- Covering a tree by a forest
- The Scaling Network Simplex Algorithm
- Understanding retiming through maximum average-delay cycles
- Faster scaling algorithms for general graph matching problems
- scientific article; zbMATH DE number 1953188 (Why is no real title available?)
- A simple reduction from maximum weight matching to maximum cardinality matching
- Finding real-valued single-source shortest paths in o(n^3) expected time
- AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗
- Scaling Algorithms for the Shortest Paths Problem
- Geometric algorithms for the minimum cost assignment problem
- AN EFFICIENT COST SCALING ALGORITHM FOR THE INDEPENDENT ASSIGNMENT PROBLEM
- Weighted matching as a generic pruning technique applied to optimization constraints
- Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms
- Computing the unrooted maximum agreement subtree in sub-quadratic time
- Min-Cost Flow in Unit-Capacity Planar Graphs
- Efficient algorithms for geometric partial matching
- A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings
- Approximate minimum-weight matching with outliers under translation
- An algorithm for the maximum weight strongly stable matching problem
- A weighted perfect matching with constraints on weights of its parts
- Temporal clustering
- A filtering technique for all pairs approximate parameterized string matching
- scientific article; zbMATH DE number 7278033 (Why is no real title available?)
- On a matching distance between rooted phylogenetic trees
- Scaling: a canonical design problem for networks
- PERSISTENCE BARCODES FOR SHAPES
- Scalable Algorithms for Data and Network Analysis
- Algorithms for the transportation problem in geometric settings
- Efficient algorithms for maximum weight matchings in general graphs with small edge weights
- A scaling algorithm for maximum weight matching in bipartite graphs
- Algorithms for weighted matching generalizations. I: Bipartite graphs, b-matching, and unweighted f-factors
- Distribution-Free Consistent Independence Tests via Center-Outward Ranks and Signs
- Finding approximate patterns in undirected acyclic graphs
- On the shortest path problem with negative cost cycles
- Blocking trails for \(f\)-factors of multigraphs
- A weight-scaling algorithm for \(f\)-factors of multigraphs
- The dynamics of rank-maximal and popular matchings
- Interval graphs with side (and size) constraints
- Computing the agreement of trees with bounded degrees
- Repeatedly matching items to agents fairly and efficiently
- PTAS for \(p\)-means \(q\)-medoids \(r\)-given clustering problem
- A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
- Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages
- Finding smallest supertrees
- An efficient scaling algorithm for the minimum weight bibranching problem
- Repeatedly matching items to agents fairly and efficiently
- PTAS for problems of vector choice and clustering with different centers
This page was built for publication: Faster Scaling Algorithms for Network Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4729348)
