Pages that link to "Item:Q3455544"

The following pages link to Approximation algorithms for classification problems with pairwise relationships (Q3455544):

Displaying 50 items.

• Inference methods for CRFs with co-occurrence statistics (Q362141) (← links)
• Fast approximate energy minimization with label costs (Q409135) (← links)
• Geometric rounding: A dependent randomized rounding scheme (Q411220) (← links)
• Algorithmic aspects of homophyly of networks (Q501003) (← links)
• Semi-supervised graph clustering: a kernel approach (Q1009309) (← links)
• A study of the quadratic semi-assignment polytope (Q1013294) (← links)
• Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems (Q1026110) (← links)
• The Boolean quadratic programming problem with generalized upper bound constraints (Q1652009) (← links)
• On discrete preferences and coordination (Q1686225) (← links)
• An improved algorithm for fixed-hub single allocation problems (Q1697895) (← links)
• Convex variational methods on graphs for multiclass segmentation of high-dimensional data and point clouds (Q1702637) (← links)
• Improved approximation algorithms for the maximum happy vertices and edges problems (Q1750352) (← links)
• Minimizing energies with hierarchical costs (Q1931618) (← links)
• Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
• On the theory of dynamic graph regression problem (Q2091389) (← links)
• Sublinear update time randomized algorithms for dynamic graph regression (Q2245047) (← links)
• A survey and comparison of discrete and continuous multi-label optimization approaches for the Potts model (Q2254247) (← links)
• Discrete and continuous models for partitioning problems (Q2254249) (← links)
• Empathetic decision making in social networks (Q2321326) (← links)
• Ramsey-type theorems for metric spaces with applications to online problems (Q2496321) (← links)
• How bad is forming your own opinion? (Q2516243) (← links)
• Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints (Q2668740) (← links)
• Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q2980928) (← links)
• Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions (Q3010396) (← links)
• Submodular Cost Allocation Problem and Applications (Q3012819) (← links)
• Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems (Q3196381) (← links)
• Lifting Methods for Manifold-Valued Variational Problems (Q3300534) (← links)
• Assignment Flows (Q3300540) (← links)
• Weakly Modular Graphs and Nonpositive Curvature (Q3380549) (← links)
• Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks (Q3439525) (← links)
• Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem (Q4577771) (← links)
• Sperner’s Colorings and Optimal Partitioning of the Simplex (Q4604392) (← links)
• Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q4622772) (← links)
• (Q4633022) (← links)
• (Q4637032) (← links)
• Discrete Convex Functions on Graphs and Their Algorithmic Applications (Q4689627) (← links)
• Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment (Q4689763) (← links)
• (Q4998944) (← links)
• Simplex Transformations and the Multiway Cut Problem (Q5000653) (← links)
• Communication Complexity of Statistical Distance (Q5002655) (← links)
• (Q5002776) (← links)
• Retracting Graphs to Cycles (Q5091228) (← links)
• Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
• Optimality of Correlated Sampling Strategies (Q5140847) (← links)
• Diffusion methods for classification with pairwise relationships (Q5233998) (← links)
• Efficient Relaxations for Dense CRFs with Sparse Higher-Order Potentials (Q5236643) (← links)
• Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time (Q5348455) (← links)
• Advances in metric embedding theory (Q5894374) (← links)
• A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)
• Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5918330) (← links)