Pages that link to "Item:Q3455544"
From MaRDI portal
The following pages link to Approximation algorithms for classification problems with pairwise relationships (Q3455544):
Displaying 8 items.
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5919045) (← links)
- Exact algorithms for a discrete metric labeling problem (Q5920404) (← links)
- Discrete convexity and polynomial solvability in minimum 0-extension problems (Q5962712) (← links)
- Stochastic approximation of lamplighter metrics (Q6048880) (← links)
- Wasserstein distance and metric trees (Q6113469) (← links)
- A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case (Q6130232) (← links)
- Coupling from the past for exponentially ergodic one-dimensional probabilistic cellular automata (Q6136791) (← links)
- Generalized minimum 0-extension problem and discrete convexity (Q6665385) (← links)