The following pages link to Journal of Algorithms (Q2709787):
Displaying 50 items.
- Special issue: 10th annual ACM-SIAM symposium on discrete algorithms (SODA), Baltimore, MD, USA, January 17--19, 1999 (Q2709788) (← links)
- Eliminating migration in multi-processor scheduling (Q2709789) (← links)
- Wavelength conversion in optical networks (Q2709790) (← links)
- Cut tree algorithms: An experimental study (Q2709792) (← links)
- A small approximately min-wise independent family of hash functions (Q2709793) (← links)
- Efficiently approximating the minimum-volume bounding box of a point set in three dimensions (Q2709794) (← links)
- Efficient algorithms for Petersen's matching theorem (Q2709795) (← links)
- Combinatorial approximation algorithms for generalized flow problems (Q2709797) (← links)
- Compact routing with minimum stretch (Q2709798) (← links)
- Median bounds and their application (Q2709799) (← links)
- Constructing optimal trees from quartets (Q2709800) (← links)
- Placement algorithms for hierarchical cooperative caching (Q2709801) (← links)
- Balanced aspect ratio trees: Combining the advantages of \(k\)-\(d\) trees and octrees (Q2709802) (← links)
- All-pairs small-stretch paths (Q2729642) (← links)
- An efficient \({\mathcal {NC}}\) algorithm for a sparse \(k\)-edge-connectivity certificate (Q2729643) (← links)
- An efficient exact algorithm for constraint bipartite vertex cover (Q2729644) (← links)
- Approximation algorithms for dispersion problems (Q2729645) (← links)
- On minimum edge ranking spanning trees (Q2729646) (← links)
- Using homogeneous weights for approximating the partial cover problem (Q2729647) (← links)
- A lower bound for elementary oblivious routing on three-dimensional meshes (Q2729648) (← links)
- A new way of using semidefinite programming with applications to linear equations mod \(p\) (Q2729649) (← links)
- Space efficient suffix trees (Q2729650) (← links)
- Greedy local improvement and weighted set packing approximation (Q2729651) (← links)
- Optimal randomized EREW PRAM algorithms for finding spanning forests (Q2731600) (← links)
- Fault-tolerant broadcasting in radio networks (Q2731601) (← links)
- A simple algorithm for the planar multiway cut problem (Q2731602) (← links)
- Approximating layout problems on random geometric graphs (Q2731603) (← links)
- On Markov chains for randomly \(H\)-coloring a graph (Q2731604) (← links)
- New algorithm for ordered tree-to-tree correction problem (Q2746431) (← links)
- Unique maximum matching algorithms (Q2746432) (← links)
- Approximation algorithms for MAX-4-SAT and rounding procedures for semidefinite programs (Q2746433) (← links)
- An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings (Q2746434) (← links)
- Digital access to comparison-based tree data structures and algorithms (Q2746435) (← links)
- Improved bandwidth approximation for trees and chordal graphs (Q2746436) (← links)
- The complete analysis of a polynomial factorization algorithm over finite fields (Q2746437) (← links)
- A simple linear time algorithm for proper box rectangular drawings of plane graphs (Q2746438) (← links)
- An almost-greedy search on random binary vectors and random graphs (Q2746439) (← links)
- The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs (Q2765953) (← links)
- Approximation algorithms for independent sets in map graphs (Q2765954) (← links)
- Efficient merging and construction of evolutionary trees (Q2765955) (← links)
- Computing Chow forms and some applications (Q2765956) (← links)
- Deterministic dictionaries (Q2765957) (← links)
- How helpers hasten \(h\)-relations (Q2765958) (← links)
- Approximating coloring and maximum independent sets in 3-uniform hypergraphs (Q2765960) (← links)
- The \(k\)-client problem (Q2775884) (← links)
- Approximation algorithms for maximization problems arising in graph partitioning (Q2775885) (← links)
- An efficient approximation algorithm for minimizing makespan on uniformly related machines. (Q2775886) (← links)
- The complexity of gene placement (Q2775888) (← links)
- Optimality and greed in dynamic allocation (Q2775889) (← links)
- An \(O(\sqrt N)\) oblivious routing algorithm for two-dimensional meshes of constant queue-size (Q2775890) (← links)
