The following pages link to Segmentation problems (Q5501190):
Displaying 18 items.
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
- Some results of Christos Papadimitriou on internet structure, network routing, and web information (Q458485) (← links)
- Simple probabilistic analysis to generalize bottleneck graph multi-partitioning (Q714518) (← links)
- Parameterized complexity of categorical clustering with size constraints (Q832880) (← links)
- Upper bound for the approximation ratio of a class of hypercube segmentation algorithms (Q835011) (← links)
- Clustering Boolean tensors (Q1715898) (← links)
- PASS approximation: a framework for analyzing and designing heuristics (Q1950388) (← links)
- Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- Preference elicitation and robust winner determination for single- and multi-winner social choice (Q2287202) (← links)
- Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix (Q2358291) (← links)
- An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation (Q2358849) (← links)
- Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives (Q2417370) (← links)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- Proportional Approval Voting, Harmonic k-median, and Negative Association (Q5002696) (← links)
- Parameterized Low-Rank Binary Matrix Approximation (Q5002728) (← links)
- (Q5009594) (← links)
- Parameterized complexity of categorical clustering with size constraints (Q6098152) (← links)
