scientific article; zbMATH DE number 1775433

MaRDI QIDQ4542566zbMATH OpenFDO

Authors Prabhakar Raghavan, Jon M. Kleinberg, Christos Papadimitriou

Publication date 17 September 2002

zbMATH Keywords

segmentation problems

Mathematics Subject Classification ID

Approximation algorithms (68W25) Search theory (90B40) Sensitivity, stability, parametric optimization (90C31) Programming involving graphs or networks (90C35)

Recommendations

• Segmentation problems
• scientific article; zbMATH DE number 1305507
• Clustering problems in optimization models
• On Two Segmentation Problems
• Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems

Cited in

(17)

• Strongly polynomial efficient approximation scheme for segmentation
• Discovering recurring activity in temporal networks
• The graph segmentation problem
• The platform design problem
• Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems
• Finding segmentations of sequences
• Research of multicriteria theoretical segmentation tasks on bipartite graphs
• scientific article; zbMATH DE number 1305507 (Why is no real title available?)
• On Two Segmentation Problems
• scientific article; zbMATH DE number 7378704 (Why is no real title available?)
• Time optimization of segmentation methods for computing the bounds of correlation functions
• Segmentation problems
• Data reduction for weighted and outlier-resistant clustering
• Recommendation systems: A probabilistic analysis
• Troubleshooting image segmentation models with human-in-the-loop
• Core potentials: the consensus segmentation conjecture
• Upper bound for the approximation ratio of a class of hypercube segmentation algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542566)