"Approximability of cycle covers and smoothed analysis of binary search trees."

Bodo Manthey (2005)

> Home

Details and statistics

DOI: —

access: unavailable

type: Book or Thesis

metadata version: 2011-03-23

- no documents available
- export record
  dblp key:
  - books/daglib/0015174
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/daglib/0015174
Bodo Manthey:
Approximability of cycle covers and smoothed analysis of binary search trees. Universität Lübeck, 2005, pp. I-XI, 1-117

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.