default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 33
Volume 33, Number 1, October 1999
- David Pisinger
:
Linear Time Algorithms for Knapsack Problems with Bounded Weights. 1-14 - Joseph Cheriyan, Ramakrishna Thurimella:
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation. 15-50 - Lisa Fleischer:
Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time. 51-72 - Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li:
Approximation Algorithms for Directed Steiner Problems. 73-91 - Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth:
Improving Minimum Cost Spanning Trees by Upgrading Nodes. 92-111 - C. R. Subramanian:
Minimum Coloring k-Colorable Graphs in Polynomial Average Time. 112-123 - Anders Yeo:
A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph. 124-139 - Mario Alberto López, Shlomo Reisner:
Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids. 140-165 - Alan M. Frieze, Michael Molloy:
Splitting an Expander Graph. 166-172 - Noga Alon, Benny Sudakov:
On Two Segmentation Problems. 173-184
Volume 33, Number 2, November 1999
- Paul Pritchard:
On Computing the Subset Graph of a Collection of Sets. 187-203 - Ming-Deh A. Huang, Ashwin J. Rao:
Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications. 204-228 - Mikkel Thorup:
Decremental Dynamic Connectivity. 229-243 - Greg N. Frederickson, Roberto Solis-Oba:
Increasing the Weight of Minimum Spanning Trees. 244-266 - Ron Shamir, Dekel Tsur:
Faster Subtree Isomorphism. 267-280 - Petrisor Panaite, Andrzej Pelc:
Exploring Unknown Undirected Graphs. 281-295 - Dimitris Bertsimas, David Gamarnik:
Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing. 296-318
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-01-18 01:10 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:
