Pages that link to "Item:Q4729349"
From MaRDI portal
The following pages link to A Fast Parametric Maximum Flow Algorithm and Applications (Q4729349):
Displaying 50 items.
- Stackelberg bipartite vertex cover and the preflow algorithm (Q270027) (← links)
- Improved balanced flow computation using parametric flow (Q284342) (← links)
- Domain decomposition methods with graph cuts algorithms for total variation minimization (Q421368) (← links)
- Graph clustering (Q458448) (← links)
- Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs (Q492813) (← links)
- Approximation schemes for the parametric knapsack problem (Q506160) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- Structural and algorithmic properties for parametric minimum cuts (Q715078) (← links)
- The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths (Q741538) (← links)
- Evaluating performance of image segmentation criteria and techniques (Q743635) (← links)
- Baseball playoff eliminations: An application of linear programming. Erratum (Q807312) (← links)
- Strengthening ties towards a highly-connected world (Q832669) (← links)
- Energy optimal schedules for jobs with multiple active intervals (Q844896) (← links)
- On total variation minimization and surface evolution using parametric maximum flows (Q847514) (← links)
- A faster algorithm for computing the principal sequence of partitions of a graph (Q848839) (← links)
- An efficient algorithm for solving pseudo clique enumeration problem (Q848935) (← links)
- A solution to the random assignment problem on the full preference domain (Q860356) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem (Q896163) (← links)
- On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems (Q897915) (← links)
- Parametric stable marriage and minimum cuts (Q913621) (← links)
- Dynamic evolution of economically preferred facilities (Q954890) (← links)
- An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths (Q967437) (← links)
- Approximating the Minimum Chain Completion problem (Q989547) (← links)
- Submodular function minimization (Q995782) (← links)
- Optimal location with equitable loads (Q1026600) (← links)
- A parametric maximum flow algorithm for bipartite graphs with applications (Q1129980) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- A fast algorithm for the generalized parametric minimum cut problem and applications (Q1186785) (← links)
- Transitions in geometric minimum spanning trees (Q1199130) (← links)
- Generalization of a theorem on the parametric maximum flow problem (Q1208465) (← links)
- Extracting maximal information about sets of minimum cuts (Q1261290) (← links)
- Linear programming for the \(0-1\) quadratic knapsack problem (Q1268263) (← links)
- Lagrangean methods for the 0-1 quadratic knapsack problem (Q1268265) (← links)
- Diagnosing infeasibilities in network flow problems (Q1290604) (← links)
- Minimizing a submodular function arising from a concave function (Q1304480) (← links)
- A faster parametric minimum-cut algorithm (Q1317480) (← links)
- Algorithms and complexity analysis for some flow problems (Q1317482) (← links)
- A faster algorithm for computing the strength of a network (Q1318743) (← links)
- Computing maximum mean cuts (Q1329796) (← links)
- Parametric max flow problems in a class of networks with series-parallel structure (Q1332816) (← links)
- Dynamic expression trees (Q1346771) (← links)
- Maximal closure on a graph with resource constraints (Q1366709) (← links)
- On strongly polynomial dual simplex algorithms for the maximum flow problem (Q1373745) (← links)
- How to compute least infeasible flows (Q1373747) (← links)
- A push-relabel framework for submodular function minimization and applications to parametric optimization (Q1410685) (← links)
- Improving graph partitions using submodular functions. (Q1410700) (← links)
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
- A note on optimal covering augmentation for graphic polymatroids. (Q1603399) (← links)
- Complexity of finding dense subgraphs (Q1613384) (← links)
