Pages that link to "Item:Q1410685"

The following pages link to A push-relabel framework for submodular function minimization and applications to parametric optimization (Q1410685):

Displaying 33 items.

• Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736) (← links)
• Improved Markov chain Monte Carlo method for cryptanalysis substitution-transposition cipher (Q350295) (← links)
• Hypergraphic submodular function minimization (Q393937) (← links)
• An approximation algorithm for the dynamic facility location problem with submodular penalties (Q403471) (← links)
• LP-based covering games with low price of anarchy (Q493659) (← links)
• Efficient minimization of higher order submodular functions using monotonic Boolean functions (Q507571) (← links)
• Structural and algorithmic properties for parametric minimum cuts (Q715078) (← links)
• Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← links)
• Submodular function minimization (Q995782) (← links)
• Minimizing a submodular function arising from a concave function (Q1304480) (← links)
• Simple push-relabel algorithms for matroids and submodular flows (Q1926643) (← links)
• Equivalence of convex minimization problems over base polytopes (Q1926652) (← links)
• Approximation algorithms for the submodular edge cover problem with submodular penalties (Q2031056) (← links)
• Approximation algorithm for stochastic set cover problem (Q2039642) (← links)
• Approximation algorithms for the multiprocessor scheduling with submodular penalties (Q2047204) (← links)
• Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty (Q2084632) (← links)
• An approximation algorithm for the generalized prize-collecting Steiner forest problem with submodular penalties (Q2136518) (← links)
• Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties (Q2168731) (← links)
• Approximation algorithms for the dynamic \(k\)-level facility location problems (Q2220850) (← links)
• A primal-dual algorithm for the minimum partial set multi-cover problem (Q2307495) (← links)
• Discrete Newton methods for the evacuation problem (Q2330131) (← links)
• Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties (Q2353460) (← links)
• A cross-monotonic cost-sharing scheme for the concave facility location game (Q2393059) (← links)
• A strongly polynomial algorithm for line search in submodular polyhedra (Q2427694) (← links)
• A primal-dual approximation algorithm for the facility location problem with submodular penalties (Q2429335) (← links)
• The warehouse-retailer network design game (Q2514656) (← links)
• Approximation algorithms for the minimum power cover problem with submodular/linear penalties (Q2672626) (← links)
• A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows (Q2785397) (← links)
• Theory of Principal Partitions Revisited (Q2971607) (← links)
• A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences (Q4385162) (← links)
• A primal-dual -approximation algorithm for the stochastic facility location problem with submodular penalties (Q4981876) (← links)
• Minimization problems with non-submodular cover constraint (Q6542984) (← links)
• Minimizing convex functions with rational minimizers (Q6567265) (← links)