scientific article; zbMATH DE number 1305507

MaRDI QIDQ4252398zbMATH OpenFDO

Authors Yevgeniy Dodis, Sanjeev Khanna, Venkatesan Guruswami

Publication date 13 June 2000

zbMATH Keywords

2-catalog segmentation problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Semidefinite programming (90C22)

Recommendations

• Approximating the 2-catalog segmentation problem using semidefinite programming relaxations
• Quasi-random PCP and hardness of 2-catalog segmentation
• Segmentation problems
• Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems
• scientific article; zbMATH DE number 1775433

Cited in

(11)

• 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
• Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems
• Quasi-random PCP and hardness of 2-catalog segmentation
• 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 1775433 (Why is no real title available?)
• Approximating the 2-catalog segmentation problem using semidefinite programming relaxations
• On Two Segmentation Problems
• Segmentation problems
• 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 Q4252398)