AAAAAA

   
Results: 1-13 |
Results: 13
Optimal collective dichotomous choice under partial order constraints
Authors: Ben-Yashar, R Khuller, S Kraus, S
Citation: R. Ben-yashar et al., Optimal collective dichotomous choice under partial order constraints, MATH SOC SC, 41(3), 2001, pp. 349-364
Centers of sets of pixels
Authors: Khuller, S Rosenfeld, A Wu, A
Citation: S. Khuller et al., Centers of sets of pixels, DISCR APP M, 103(1-3), 2000, pp. 297-306
The capacitated K-center problem
Authors: Khuller, S Sussmann, YJ
Citation: S. Khuller et Yj. Sussmann, The capacitated K-center problem, SIAM J DISC, 13(3), 2000, pp. 403-418
Fault tolerant K-center problems
Authors: Khuller, S Pless, R Sussmann, YJ
Citation: S. Khuller et al., Fault tolerant K-center problems, THEOR COMP, 242(1-2), 2000, pp. 237-245
The loading time scheduling problem
Authors: Bhatia, R Khuller, S Naor, JS
Citation: R. Bhatia et al., The loading time scheduling problem, J ALGORITHM, 36(1), 2000, pp. 1-33
Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
Authors: Guttmann-Beck, N Hassin, R Khuller, S Raghavachari, B
Citation: N. Guttmann-beck et al., Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem, ALGORITHMIC, 28(4), 2000, pp. 422-437
The full-degree spanning tree problem
Authors: Bhatia, R Khuller, S Pless, R Sussmann, YJ
Citation: R. Bhatia et al., The full-degree spanning tree problem, NETWORKS, 36(4), 2000, pp. 203-209
An O(vertical bar V vertical bar(2)) algorithm for single connectedness (vol 72, pg 105, 1999)
Authors: Khuller, S
Citation: S. Khuller, An O(vertical bar V vertical bar(2)) algorithm for single connectedness (vol 72, pg 105, 1999), INF PROCESS, 74(5-6), 2000, pp. 263-263
Improved methods for approximating node weighted Steiner trees and connected dominating sets
Authors: Guha, S Khuller, S
Citation: S. Guha et S. Khuller, Improved methods for approximating node weighted Steiner trees and connected dominating sets, INF COMPUT, 150(1), 1999, pp. 57-74
Greedy strikes back: Improved facility location algorithms
Authors: Guha, S Khuller, S
Citation: S. Guha et S. Khuller, Greedy strikes back: Improved facility location algorithms, J ALGORITHM, 31(1), 1999, pp. 228-248
An O(vertical bar V vertical bar(2)) algorithm for single connectedness
Authors: Khuller, S
Citation: S. Khuller, An O(vertical bar V vertical bar(2)) algorithm for single connectedness, INF PROCESS, 72(3-4), 1999, pp. 105-107
The budgeted maximum coverage problem
Authors: Khuller, S Moss, A Naor, JS
Citation: S. Khuller et al., The budgeted maximum coverage problem, INF PROCESS, 70(1), 1999, pp. 39-45
Facility location with dynamic distance functions
Authors: Bhatia, R Guha, S Khuller, S Sussmann, YJ
Citation: R. Bhatia et al., Facility location with dynamic distance functions, J COMB OPTI, 2(3), 1998, pp. 199-217
Risultati: 1-13 |