AAAAAA

   
Results: 1-7 |
Results: 7
ON CHROMATIC SUMS AND DISTRIBUTED RESOURCE-ALLOCATION
Authors: BARNOY A BELLARE M HALLDORSSON MM SHACHNAI H TAMIR T
Citation: A. Barnoy et al., ON CHROMATIC SUMS AND DISTRIBUTED RESOURCE-ALLOCATION, Information and computation, 140(2), 1998, pp. 183-202
APPROXIMATING STEINER TREES IN GRAPHS WITH RESTRICTED WEIGHTS
Authors: HALLDORSSON MM UENO S NAKAO H KAJITANI Y
Citation: Mm. Halldorsson et al., APPROXIMATING STEINER TREES IN GRAPHS WITH RESTRICTED WEIGHTS, Networks, 31(4), 1998, pp. 283-292
PARALLEL AND ONLINE GRAPH-COLORING
Authors: HALLDORSSON MM
Citation: Mm. Halldorsson, PARALLEL AND ONLINE GRAPH-COLORING, Journal of algorithms, 23(2), 1997, pp. 265-280
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
LOWER BOUNDS FOR ONLINE GRAPH-COLORING
Authors: HALLDORSSON MM SZEGEDY M
Citation: Mm. Halldorsson et M. Szegedy, LOWER BOUNDS FOR ONLINE GRAPH-COLORING, Theoretical computer science, 130(1), 1994, pp. 163-174
APPROXIMATING THE TREE AND TOUR COVERS OF A GRAPH
Authors: ARKIN EM HALLDORSSON MM HASSIN R
Citation: Em. Arkin et al., APPROXIMATING THE TREE AND TOUR COVERS OF A GRAPH, Information processing letters, 47(6), 1993, pp. 275-282
APPROXIMATING THE MINIMUM MAXIMAL INDEPENDENCE NUMBER
Authors: HALLDORSSON MM
Citation: Mm. Halldorsson, APPROXIMATING THE MINIMUM MAXIMAL INDEPENDENCE NUMBER, Information processing letters, 46(4), 1993, pp. 169-172
Risultati: 1-7 |