Computing and Combinatorics

DOI10.1007/11533719MaRDI QIDQ5716987zbMATH OpenOpenAlexFDO

Authors Guoxuan Ma, Yu Wei, Jiming Peng

Publication date 11 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11533719

Mathematics Subject Classification ID

Quadratic programming (90C20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An approximation ratio for biclustering
• Clustering with balancing constraints
• Approximation Algorithms for Biclustering Problems
• Faster balanced clusterings in high dimension
• An approximation polynomial-time algorithm for a sequence bi-clustering problem

Cited in

(4)

• An approximation ratio for biclustering
• Clustering with balancing constraints
• On the complexity of clustering with relaxed size constraints in fixed dimension
• Improved algorithms for distributed balanced clustering

This page was built for publication: Computing and Combinatorics

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