default search action
Discrete Applied Mathematics, Volume 110
Volume 110, Number 1, June 2001
- Roberto Battiti, Alan A. Bertossi, Silvano Martello:
Editorial. 1 - Alberto Bertoni, Paola Campadelli, Giuliano Grossi
:
An approximation algorithm for the maximum cut problem and its experimental analysis. 3-12 - Paola Bonizzoni
Experimenting an approximation algorithm for the LCS. 13-24 - Mauro Dell'Amico
Efficient algorithms and codes for k-cardinality assignment problems. 25-40 - Nicola Galli, Bernhard Seybold, Klaus Simon:
Tetris-Hashing or optimal table compression. 41-58 - Mark K. Goldberg, David L. Hollinger:
Designing algorithms by sampling. 59-75 - Vesa Hirvisalo, Esko Nuutila, Eljas Soisalon-Soininen:
Transitive closure algorithm MEMTC and its performance analysis. 77-84
Volume 110, Number 2-3, June 2001
- Susanne Albers, Günter Schmidt
Scheduling with unexpected machine breakdowns. 85-99 - Sergei L. Bezrukov:
Embedding complete trees into the hypercube. 101-119 - Katarína Cechlárová
Persistency in combinatorial optimization problems on matroids. 121-132 - Bo Chen
On-line scheduling of small open shops. 133-150 - Danny Z. Chen, Gautam Das
Lower bounds for computing geometric spanners and approximate shortest paths. 151-167 - Michel Habib
Efficient algorithms on distributive lattices. 169-187 - Toru Hasunuma, Hiroshi Nagamochi:
Independent spanning trees with small depths in iterated line digraphs. 189-211 - Dusan Hvalica:
Searching for a minimal solution subgraph in explicit AND/OR graphs. 213-225 - Dimitrios Kagaris, Spyros Tragoudas:
Computational analysis of counter-based schemes for VLSI test pattern generation. 227-250 - Igor Pak, Van H. Vu:
On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes. 251-272 - Han Ren, Yanpei Liu:
Enumerating near-4-regular maps on the sphere and the torus. 273-288 - Irena Rusu, Jeremy P. Spinrad:
Domination graphs: examples and counterexamples. 289-300 - F. Bruce Shepherd, Lisa Zhang:
A cycle augmentation algorithm for minimum cost multicommodity flows on a ring. 301-315 - Koichi Yamazaki
On approximation intractability of the path-distance-width problem. 317-325
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 2024-12-22 19:02 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: