A Fast Random Greedy Algorithm for the Component Commonality Problem

Authors:
Ravi Kannan;Andreas Nolte
Affiliations:
-;-
Venue:
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Year:
1998

Citing 4
Cited 0

Stochastic programming

Optimization
A random polynomial-time algorithm for approximating the volume of convex bodies

Journal of the ACM (JACM)
Randomized algorithms

Randomized algorithms
A randomized algorithm to optimize over certain convex sets

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a fast, randomized greedy algorithm to solve the Component Commonality Problem approximately. It is based on a geometric random walk, that starts from a given initial solution and accepts only better points during the walk. We use a new type of analysis, that is not based on conductance, but makes use of structural geometric properties of the problem, namely the smoothness of the set of feasible points.