default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 38
Volume 38, Number 1, January 2001
- Bernard M. E. Moret:
Foreword. 1 - Bala Kalyanasundaram, Kirk Pruhs:
Eliminating Migration in Multi-processor Scheduling. 2-24 - Jon M. Kleinberg, Amit Kumar
:
Wavelength Conversion in Optical Networks. 25-50 - Andrew V. Goldberg, Kostas Tsioutsiouliklis:
Cut Tree Algorithms: An Experimental Study. 51-83 - Piotr Indyk:
A Small Approximately Min-Wise Independent Family of Hash Functions. 84-90 - Gill Barequet, Sariel Har-Peled:
Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. 91-109 - Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw:
Efficient Algorithms for Petersen's Matching Theorem. 110-134 - Jeffrey D. Oldham:
Combinatorial Approximation Algorithms for Generalized Flow Problems. 135-169 - Lenore Cowen:
Compact Routing with Minimum Stretch. 170-183 - Alan Siegel:
Median Bounds and Their Application. 184-236 - David Bryant, Mike A. Steel:
Constructing Optimal Trees from Quartets. 237-259 - Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman:
Placement Algorithms for Hierarchical Cooperative Caching. 260-302 - Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees. 303-333
Volume 38, Number 2, February 2001
- Edith Cohen, Uri Zwick:
All-Pairs Small-Stretch Paths. 335-353 - Hiroshi Nagamochi, Toru Hasunuma:
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. 354-373 - Henning Fernau, Rolf Niedermeier:
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. 374-410 - Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki:
On Minimum Edge Ranking Spanning Trees. 411-437 - Barun Chandra, Magnús M. Halldórsson:
Approximation Algorithms for Dispersion Problems. 438-465
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.
last updated on 2025-12-04 01:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
