Segmentation problems
DOI10.1145/972639.972644zbMATH Open1317.90329OpenAlexW2293218619WikidataQ57904531 ScholiaQ57904531MaRDI QIDQ5501190FDOQ5501190
Authors: Prabhakar Raghavan, Jon M. Kleinberg, Christos Papadimitriou 
Publication date: 1 August 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/972639.972644
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)
Cited In (28)
- Parameterized complexity of categorical clustering with size constraints
- Upper bound for the approximation ratio of a class of hypercube segmentation algorithms
- Proportional approval voting, harmonic \(k\)-median, and negative association
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis
- Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives
- The graph segmentation problem
- Parameterized complexity of categorical clustering with size constraints
- Simple probabilistic analysis to generalize bottleneck graph multi-partitioning
- Strongly polynomial efficient approximation scheme for segmentation
- 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
- Parameterized low-rank binary matrix approximation
- Title not available (Why is that?)
- Some results of Christos Papadimitriou on internet structure, network routing, and web information
- Research of multicriteria theoretical segmentation tasks on bipartite graphs
- Quasi-random PCP and hardness of 2-catalog segmentation
- Preference elicitation and robust winner determination for single- and multi-winner social choice
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding
- Time optimization of segmentation methods for computing the bounds of correlation functions
- Core potentials: the consensus segmentation conjecture
- PASS approximation: a framework for analyzing and designing heuristics
- Parameterized low-rank binary matrix approximation
- Finding segmentations of sequences
- Title not available (Why is that?)
- Troubleshooting image segmentation models with human-in-the-loop
- On Two Segmentation Problems
- Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs
- Clustering Boolean tensors
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)
