Segmentation problems
From MaRDI portal
Recommendations
Cited in
(31)- Strongly polynomial efficient approximation scheme for segmentation
- Clustering Boolean tensors
- The graph segmentation problem
- PASS approximation: a framework for analyzing and designing heuristics
- Fully polynomial time (,)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs
- Parameterized low-rank binary matrix approximation
- Preference elicitation and robust winner determination for single- and multi-winner social choice
- Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix
- An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation
- Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives
- Inapproximability of maximum biclique problems, minimum k-cut and densest at-least- k-subgraph from the small set expansion hypothesis
- Quasi-random PCP and hardness of 2-catalog segmentation
- Finding segmentations of sequences
- Research of multicriteria theoretical segmentation tasks on bipartite graphs
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding
- scientific article; zbMATH DE number 1305507 (Why is no real title available?)
- scientific article; zbMATH DE number 1775433 (Why is no real title available?)
- Some results of Christos Papadimitriou on internet structure, network routing, and web information
- On Two Segmentation Problems
- Proportional approval voting, harmonic \(k\)-median, and negative association
- Parameterized low-rank binary matrix approximation
- scientific article; zbMATH DE number 7378704 (Why is no real title available?)
- Time optimization of segmentation methods for computing the bounds of correlation functions
- Parameterized complexity of categorical clustering with size constraints
- Troubleshooting image segmentation models with human-in-the-loop
- Core potentials: the consensus segmentation conjecture
- Revisiting non-monotone regularized submodular maximization: bi-criteria and pass approximations
- Customer segmentation using flying fox optimization algorithm
- Simple probabilistic analysis to generalize bottleneck graph multi-partitioning
- Parameterized complexity of categorical clustering with size constraints
- Upper bound for the approximation ratio of a class of hypercube segmentation algorithms
This page was built for publication: Segmentation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501190)
