AAAAAA

   
Results: 1-7 |
Results: 7
On approximating the achromatic number
Authors: Kortsarz, G Krauthgamer, R
Citation: G. Kortsarz et R. Krauthgamer, On approximating the achromatic number, SIAM J DISC, 14(3), 2001, pp. 408-422
Generalized submodular cover problems and applications
Authors: Bar-Ilan, J Kortsarz, G Peleg, D
Citation: J. Bar-ilan et al., Generalized submodular cover problems and applications, THEOR COMP, 250(1-2), 2001, pp. 179-200
On the hardness of approximating spanners
Authors: Kortsarz, G
Citation: G. Kortsarz, On the hardness of approximating spanners, ALGORITHMIC, 30(3), 2001, pp. 432-450
The dense k-subgraph problem
Authors: Feige, U Kortsarz, G Peleg, D
Citation: U. Feige et al., The dense k-subgraph problem, ALGORITHMIC, 29(3), 2001, pp. 410-421
Sum multicoloring of graphs
Authors: Bar-Noy, A Halldorsson, MM Kortsarz, G Salman, R Shachnai, H
Citation: A. Bar-noy et al., Sum multicoloring of graphs, J ALGORITHM, 37(2), 2000, pp. 422-450
Approximating the weight of shallow Steiner trees
Authors: Kortsarz, G Peleg, D
Citation: G. Kortsarz et D. Peleg, Approximating the weight of shallow Steiner trees, DISCR APP M, 93(2-3), 1999, pp. 265-285
A matched approximation bound for the sum of a greedy coloring
Authors: Bar-Noy, A Halldorsson, MM Kortsarz, G
Citation: A. Bar-noy et al., A matched approximation bound for the sum of a greedy coloring, INF PROCESS, 71(3-4), 1999, pp. 135-140
Risultati: 1-7 |