1. Modeling Illumination Data with Flying Light Specks
2. David Arthur and Sergei Vassilvitskii . 2007 . K-Means++: The Advantages of Careful Seeding . In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms ( New Orleans, Louisiana) (SODA ’07). Society for Industrial and Applied Mathematics, USA, 1027–1035. David Arthur and Sergei Vassilvitskii. 2007. K-Means++: The Advantages of Careful Seeding. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (New Orleans, Louisiana) (SODA ’07). Society for Industrial and Applied Mathematics, USA, 1027–1035.
3. Variable neighborhood search for the heaviest -subgraph
4. Optimal Decentralized Formation of k-Member Partnerships
5. Decentralized group formation