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.
The author was supported by a DAAD-Postdoctoral Fellowship during his visit at Yale University
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dyer, M.A.; Frieze, A.:Computing the volume of convex bodies: A case where randomness provably helps, Proceedings of the Symposium on Applied Math, 1991
Dyer, M.A.; Frieze, A.; Kannan, R.:A random polynomial time algorithm for approximating the volume of convex bodies, Journal of the ACM 38, 1991
Grötschel, M.; Lovasz, L.; Schrijver, A.:Geometric Algorithms and Combinatorial Optimization, Springer Verlag, New York, 1988
Jayaraman, J.; Srinivasan, J.; Roundy, R.; Tayur, S.:Procurement of common components in a stochastic environment, IBM Technical Report, 1992
Kannan, R.; Mount, J.; Tayur, S.: A randomized Algorithm to optimize over certain convex sets, Mathematics of Operations Research 20, 1995
Motwani, R., Raghavan, P.:Randomized Algorithms, Cambridge University Press, 1995
Wets, R.: Stochastic Programming in Handbooks of Operations Research and Management Science, Vol. 1, North Holland, 1989
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kannan, R., Nolte, A. (1998). A Fast Random Greedy Algorithm for the Component Commonality Problem. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds) Algorithms — ESA’ 98. ESA 1998. Lecture Notes in Computer Science, vol 1461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68530-8_19
Download citation
DOI: https://doi.org/10.1007/3-540-68530-8_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64848-2
Online ISBN: 978-3-540-68530-2
eBook Packages: Springer Book Archive