Segmentation problems

DOI10.1145/972639.972644zbMath1317.90329OpenAlexW2293218619WikidataQ57904531 ScholiaQ57904531MaRDI QIDQ5501190

Prabhakar Raghavan, Christos H. Papadimitriou, Jon M. Kleinberg

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (19)

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 complexity of categorical clustering with size constraints ⋮ Upper bound for the approximation ratio of a class of hypercube segmentation algorithms ⋮ Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis ⋮ An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding ⋮ Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives ⋮ Unnamed Item ⋮ PASS approximation: a framework for analyzing and designing heuristics ⋮ Clustering Boolean tensors ⋮ Some results of Christos Papadimitriou on internet structure, network routing, and web information ⋮ Parameterized low-rank binary matrix approximation ⋮ Parameterized complexity of categorical clustering with size constraints ⋮ Parameterized Low-Rank Binary Matrix Approximation ⋮ Proportional Approval Voting, Harmonic k-median, and Negative Association ⋮ Simple probabilistic analysis to generalize bottleneck graph multi-partitioning ⋮ Preference elicitation and robust winner determination for single- and multi-winner social choice ⋮ Core potentials: the consensus segmentation conjecture ⋮ Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs

This page was built for publication: Segmentation problems