AAAAAA

   
Results: << | 101-125 | 126-150 | 151-175 | 176-200 | >>

Table of contents of journal: *Algorithmica

Results: 126-150/389
ORTHOGONAL QUERIES IN SEGMENTS
Authors: TOKUYAMA T
Citation: T. Tokuyama, ORTHOGONAL QUERIES IN SEGMENTS, Algorithmica, 18(2), 1997, pp. 229-245
IMPROVED BOUNDS FOR ELECTING A LEADER IN A SYNCHRONOUS RING
Authors: OVERMARS M SANTORO N
Citation: M. Overmars et N. Santoro, IMPROVED BOUNDS FOR ELECTING A LEADER IN A SYNCHRONOUS RING, Algorithmica, 18(2), 1997, pp. 246-262
A SIMPLER MINIMUM SPANNING TREE VERIFICATION ALGORITHM
Authors: KING V
Citation: V. King, A SIMPLER MINIMUM SPANNING TREE VERIFICATION ALGORITHM, Algorithmica, 18(2), 1997, pp. 263-270
CLASSES OF COST-FUNCTIONS FOR STRING EDIT DISTANCE
Authors: RICE SV BUNKE H NARTKER TA
Citation: Sv. Rice et al., CLASSES OF COST-FUNCTIONS FOR STRING EDIT DISTANCE, Algorithmica, 18(2), 1997, pp. 271-280
APPROXIMATION ALGORITHM - GUEST EDITOR FOREWORD
Authors: GOEMANS MX
Citation: Mx. Goemans, APPROXIMATION ALGORITHM - GUEST EDITOR FOREWORD, Algorithmica, 18(1), 1997, pp. 1-2
PRIMAL-DUAL APPROXIMATION ALGORITHMS FOR INTEGRAL FLOW AND MULTICUT IN TREES
Authors: GARG N VAZIRANI VV YANNAKAKIS M
Citation: N. Garg et al., PRIMAL-DUAL APPROXIMATION ALGORITHMS FOR INTEGRAL FLOW AND MULTICUT IN TREES, Algorithmica, 18(1), 1997, pp. 3-20
AN APPROXIMATION ALGORITHM FOR MINIMUM-COST VERTEX-CONNECTIVITY PROBLEMS
Authors: RAVI R WILLIAMSON DP
Citation: R. Ravi et Dp. Williamson, AN APPROXIMATION ALGORITHM FOR MINIMUM-COST VERTEX-CONNECTIVITY PROBLEMS, Algorithmica, 18(1), 1997, pp. 21-43
RANDOMIZED APPROXIMATION OF BOUNDED MULTICOVERING PROBLEMS
Authors: PELEG D SCHECHTMAN G WOOL A
Citation: D. Peleg et al., RANDOMIZED APPROXIMATION OF BOUNDED MULTICOVERING PROBLEMS, Algorithmica, 18(1), 1997, pp. 44-66
IMPROVED APPROXIMATION ALGORITHMS FOR MAX K-CUT AND MAX BISECTION
Authors: FRIEZE A JERRUM M
Citation: A. Frieze et M. Jerrum, IMPROVED APPROXIMATION ALGORITHMS FOR MAX K-CUT AND MAX BISECTION, Algorithmica, 18(1), 1997, pp. 67-81
ON APPROXIMATING THE LONGEST PATH IN A GRAPH
Authors: KARGER D MOTWANI R RAMKUMAR GDS
Citation: D. Karger et al., ON APPROXIMATING THE LONGEST PATH IN A GRAPH, Algorithmica, 18(1), 1997, pp. 82-98
A SERIES OF APPROXIMATION ALGORITHMS FOR THE ACYCLIC DIRECTED STEINERTREE PROBLEM
Authors: ZELIKOVSKY A
Citation: A. Zelikovsky, A SERIES OF APPROXIMATION ALGORITHMS FOR THE ACYCLIC DIRECTED STEINERTREE PROBLEM, Algorithmica, 18(1), 1997, pp. 99-110
AN O(LOG K)-APPROXIMATION ALGORITHM FOR THE K-MINIMUM SPANNING TREE PROBLEM IN THE PLANE
Authors: GARG N HOCHBAUM DS
Citation: N. Garg et Ds. Hochbaum, AN O(LOG K)-APPROXIMATION ALGORITHM FOR THE K-MINIMUM SPANNING TREE PROBLEM IN THE PLANE, Algorithmica, 18(1), 1997, pp. 111-121
AN ALGORITHM FOR THE 3-DIMENSIONAL PACKING PROBLEM WITH ASYMPTOTIC PERFORMANCE ANALYSIS
Authors: MIYAZAWA FK WAKABAYASHI Y
Citation: Fk. Miyazawa et Y. Wakabayashi, AN ALGORITHM FOR THE 3-DIMENSIONAL PACKING PROBLEM WITH ASYMPTOTIC PERFORMANCE ANALYSIS, Algorithmica, 18(1), 1997, pp. 122-144
GREED IS GOOD - APPROXIMATING INDEPENDENT SETS IN SPARSE AND BOUNDED-DEGREE GRAPHS
Authors: HALLDORSSON MM RADHAKRISHNAN J
Citation: Mm. Halldorsson et J. Radhakrishnan, GREED IS GOOD - APPROXIMATING INDEPENDENT SETS IN SPARSE AND BOUNDED-DEGREE GRAPHS, Algorithmica, 18(1), 1997, pp. 145-163
COMPLEXITIES OF EFFICIENT SOLUTIONS OF RECTILINEAR POLYGON COVER PROBLEMS
Authors: BERMAN P DASGUPTA B
Citation: P. Berman et B. Dasgupta, COMPLEXITIES OF EFFICIENT SOLUTIONS OF RECTILINEAR POLYGON COVER PROBLEMS, Algorithmica, 17(4), 1997, pp. 331-356
CONSTRUCTION OF C-SPACE ROADMAPS FROM LOCAL SENSORY DATA - WHAT SHOULD THE SENSORS LOOK FOR
Authors: RIMON E
Citation: E. Rimon, CONSTRUCTION OF C-SPACE ROADMAPS FROM LOCAL SENSORY DATA - WHAT SHOULD THE SENSORS LOOK FOR, Algorithmica, 17(4), 1997, pp. 357-379
ON COUNTING PAIRS OF INTERSECTING SEGMENTS AND OFF-LINE TRIANGLE RANGE SEARCHING
Authors: PELLEGRINI M
Citation: M. Pellegrini, ON COUNTING PAIRS OF INTERSECTING SEGMENTS AND OFF-LINE TRIANGLE RANGE SEARCHING, Algorithmica, 17(4), 1997, pp. 380-398
EFFICIENT PARALLEL ALGORITHMS FOR COMPUTING ALL PAIR SHORTEST PATHS IN DIRECTED-GRAPHS
Authors: HAN YJ PAN VY REIF JH
Citation: Yj. Han et al., EFFICIENT PARALLEL ALGORITHMS FOR COMPUTING ALL PAIR SHORTEST PATHS IN DIRECTED-GRAPHS, Algorithmica, 17(4), 1997, pp. 399-415
AN O(N(3)) RECOGNITION ALGORITHM FOR BITHRESHOLD GRAPHS
Authors: DEAGOSTINO S PETRESCHI H STERBINI A
Citation: S. Deagostino et al., AN O(N(3)) RECOGNITION ALGORITHM FOR BITHRESHOLD GRAPHS, Algorithmica, 17(4), 1997, pp. 416-425
NEW ALGORITHMS FOR MINIMIZING THE LONGEST WIRE LENGTH DURING CIRCUIT COMPACTION
Authors: HAMBRUSCH SE TU HY
Citation: Se. Hambrusch et Hy. Tu, NEW ALGORITHMS FOR MINIMIZING THE LONGEST WIRE LENGTH DURING CIRCUIT COMPACTION, Algorithmica, 17(4), 1997, pp. 426-448
IMPROVED PARALLEL APPROXIMATION OF A CLASS OF INTEGER PROGRAMMING-PROBLEMS
Authors: ALON N SRINIVASAN A
Citation: N. Alon et A. Srinivasan, IMPROVED PARALLEL APPROXIMATION OF A CLASS OF INTEGER PROGRAMMING-PROBLEMS, Algorithmica, 17(4), 1997, pp. 449-462
FINDING AND COUNTING GIVEN LENGTH CYCLES
Authors: ALON N YUSTER R ZWICK U
Citation: N. Alon et al., FINDING AND COUNTING GIVEN LENGTH CYCLES, Algorithmica, 17(3), 1997, pp. 209-223
RANDOMIZED MULTIPACKET ROUTING AND SORTING ON MESHES
Authors: KAUFMANN M SIBEYN JF
Citation: M. Kaufmann et Jf. Sibeyn, RANDOMIZED MULTIPACKET ROUTING AND SORTING ON MESHES, Algorithmica, 17(3), 1997, pp. 224-244
DECOMPOSING THE BOUNDARY OF A NONCONVEX POLYHEDRON
Authors: CHAZELLE B PALIOS L
Citation: B. Chazelle et L. Palios, DECOMPOSING THE BOUNDARY OF A NONCONVEX POLYHEDRON, Algorithmica, 17(3), 1997, pp. 245-265
EFFICIENT PARALLEL RECOGNITION OF SOME CIRCULAR-ARC GRAPHS .2.
Authors: CHEN L
Citation: L. Chen, EFFICIENT PARALLEL RECOGNITION OF SOME CIRCULAR-ARC GRAPHS .2., Algorithmica, 17(3), 1997, pp. 266-280
Risultati: << | 101-125 | 126-150 | 151-175 | 176-200 | >>