Pages that link to "Item:Q1850505"
From MaRDI portal
The following pages link to A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505):
Displaying 50 items.
- Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function (Q2661580) (← links)
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty (Q2664004) (← links)
- Interactive optimization of submodular functions under matroid constraints (Q2695451) (← links)
- Preference swaps for the stable matching problem (Q2699977) (← links)
- Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines (Q2806872) (← links)
- Half-integrality, LP-branching, and FPT algorithms (Q2816829) (← links)
- Covering intersecting bi-set families under matroid constraints (Q2820858) (← links)
- On a General Framework for Network Representability in Discrete Optimization (Q2835692) (← links)
- The Mixed Evacuation Problem (Q2958300) (← links)
- Theory of Principal Partitions Revisited (Q2971607) (← links)
- Graphic Submodular Function Minimization: A Graphic Approach and Applications (Q2971617) (← links)
- The fundamental theorem of linear programming: extensions and applications (Q2996803) (← links)
- Submodular Function Minimization under a Submodular Set Covering Constraint (Q3010395) (← links)
- Robust Monotone Submodular Function Maximization (Q3186512) (← links)
- Decomposition Algorithm for the Single Machine Scheduling Polytope (Q3195338) (← links)
- Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization (Q3295273) (← links)
- ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM (Q3502844) (← links)
- The Alcuin Number of a Graph (Q3541095) (← links)
- Continuous limits of discrete perimeters (Q3552260) (← links)
- ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS (Q3634201) (← links)
- Quantum machine learning: a classical perspective (Q4556858) (← links)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- (Q4633938) (← links)
- Geometric Rescaling Algorithms for Submodular Function Minimization (Q4958557) (← links)
- (Q4969210) (← links)
- Inferring Relative Ability from Winning Probability in Multientrant Contests (Q4987717) (← links)
- (Q5005108) (← links)
- (Q5009516) (← links)
- Tight Approximation for Unconstrained XOS Maximization (Q5026453) (← links)
- A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
- (Q5079734) (← links)
- (Q5092350) (← links)
- Hypergraph Cuts with General Splitting Functions (Q5094916) (← links)
- Finding a Stable Allocation in Polymatroid Intersection (Q5108257) (← links)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
- Approximate Modularity Revisited (Q5211809) (← links)
- Finding Submodularity Hidden in Symmetric Difference (Q5218436) (← links)
- Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs (Q5219669) (← links)
- Some Results about the Contractions and the Pendant Pairs of a Submodular System (Q5241673) (← links)
- The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
- A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (Q5270613) (← links)
- Approximation algorithms for general one-warehouse multi-retailer systems (Q5305566) (← links)
- ISOLATED SCATTERING NUMBER OF SPLIT GRAPHS AND GRAPH PRODUCTS (Q5370790) (← links)
- Binarisation for Valued Constraint Satisfaction Problems (Q5371026) (← links)
- A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization (Q5429271) (← links)
- Vulnerability parameters of split graphs (Q5438691) (← links)
- Introduction to the Maximum Solution Problem (Q5504706) (← links)
- (Q5743452) (← links)
- Improved Randomized Algorithm for <i>k</i>-Submodular Function Maximization (Q5855531) (← links)
- Computing with tangles (Q5890774) (← links)