Pages that link to "Item:Q517305"

The following pages link to Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305):

Displaying 9 items.

• The label cut problem with respect to path length and label frequency (Q313969) (← links)
• Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305) (← links)
• A note on submodular function minimization with covering type linear constraints (Q722536) (← links)
• Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem (Q1702134) (← links)
• Minimum label \(s\)-\(t\) cut has large integrality gaps (Q2216106) (← links)
• Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm (Q3012818) (← links)
• A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
• Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
• A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint (Q5091208) (← links)