Skip to main content
SpringerLink
Log in

A Fast Random Greedy Algorithm for the Component Commonality Problem

  • Conference paper
  • First Online:
Algorithms — ESA’ 98 (ESA 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1461))

Included in the following conference series:

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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

    Google Scholar 

  2. 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

    Google Scholar 

  3. Grötschel, M.; Lovasz, L.; Schrijver, A.:Geometric Algorithms and Combinatorial Optimization, Springer Verlag, New York, 1988

    MATH  Google Scholar 

  4. Jayaraman, J.; Srinivasan, J.; Roundy, R.; Tayur, S.:Procurement of common components in a stochastic environment, IBM Technical Report, 1992

    Google Scholar 

  5. Kannan, R.; Mount, J.; Tayur, S.: A randomized Algorithm to optimize over certain convex sets, Mathematics of Operations Research 20, 1995

    Google Scholar 

  6. Motwani, R., Raghavan, P.:Randomized Algorithms, Cambridge University Press, 1995

    Google Scholar 

  7. Wets, R.: Stochastic Programming in Handbooks of Operations Research and Management Science, Vol. 1, North Holland, 1989

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Yale University, 51 Prospect Street, New Haven, CT, 06520-8285

    Ravi Kannan

  2. Institut für Informatik, Universität zu Köln, Weyertal 80, 50931, Köln

    Andreas Nolte

Authors
  1. Ravi Kannan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Nolte
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Elettronica e Informatica, Università di Padova, via Gradenigo 6/A, I-35131, Padova, Italy

    Gianfranco Bilardi  & Geppino Pucci  & 

  2. Department of Electrical Engineering and Computer Science, The University of Illinois at Chicago, 851 South Morgan Street - 1009 SEO, Chicago, IL, 60607-7053, USA

    Gianfranco Bilardi

  3. Dipartimento di Matematica Applicata e Informatica, Università “Cá Foscari” di Venezia, via Torino 155, I-30173, Venezia Mestre, Italy

    Giuseppe F. Italiano

  4. Dipartimento di Matematica Pura e Applicata, Università di Padova, via Belzoni 7, I-35131, Padova, Italy

    Andrea Pietracaprina

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation