Obserwuj
samir khuller
samir khuller
Barris Professor and Chair of Computer Science, Northwestern University
Zweryfikowany adres z northwestern.edu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Approximation algorithms for connected dominating sets
S Guha, S Khuller
Algorithmica 20, 374-387, 1998
17511998
The budgeted maximum coverage problem
S Khuller, A Moss, JS Naor
Information processing letters 70 (1), 39-45, 1999
11611999
Landmarks in graphs
S Khuller, B Raghavachari, A Rosenfeld
Discrete applied mathematics 70 (3), 217-229, 1996
9881996
A clustering scheme for hierarchical control in multi-hop wireless networks
S Banerjee, S Khuller
Proceedings IEEE INFOCOM 2001. Conference on Computer Communications …, 2001
9042001
Greedy strikes back: Improved facility location algorithms
S Guha, S Khuller
Journal of algorithms 31 (1), 228-248, 1999
8931999
Construction of an efficient overlay multicast infrastructure for real-time applications
S Banerjee, C Kommareddy, K Kar, B Bhattacharjee, S Khuller
IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE …, 2003
6032003
Achieving anonymity via clustering
G Aggarwal, R Panigrahy, T Feder, D Thomas, K Kenthapadi, S Khuller, ...
ACM Transactions on Algorithms (TALG) 6 (3), 1-19, 2010
5892010
Algorithms for facility location problems with outliers
M Charikar, S Khuller, DM Mount, G Narasimhan
SODA 1, 642-651, 2001
5312001
Balancing minimum spanning trees and shortest-path trees
S Khuller, B Raghavachari, N Young
Algorithmica 14 (4), 305-321, 1995
4031995
On finding dense subgraphs
S Khuller, B Saha
International colloquium on automata, languages, and programming, 597-608, 2009
3482009
Biconnectivity approximations and graph carvings
S Khuller, U Vishkin
Journal of the ACM (JACM) 41 (2), 214-235, 1994
3321994
Dependent rounding and its applications to approximation algorithms
R Gandhi, S Khuller, S Parthasarathy, A Srinivasan
Journal of the ACM (JACM) 53 (3), 324-360, 2006
3202006
Approximation algorithms for partial covering problems
R Gandhi, S Khuller, A Srinivasan
Journal of Algorithms 53 (1), 55-84, 2004
2712004
Improved methods for approximating node weighted steiner trees and connected dominating sets
S Guha, S Khuller
Information and computation 150 (1), 57-74, 1999
2641999
The capacitated k-center problem
S Khuller, YJ Sussmann
SIAM Journal on Discrete Mathematics 13 (3), 403-418, 2000
248*2000
On-line algorithms for weighted bipartite matching and stable marriages
S Khuller, SG Mitchell, VV Vazirani
Theoretical Computer Science 127 (2), 255-267, 1994
2181994
Relay placement for fault tolerance in wireless networks in higher dimensions
A Kashyap, S Khuller, M Shayman
Computational Geometry 44 (4), 206-215, 2011
203*2011
Improved approximation algorithms for uniform connectivity problems
S Khuller, B Raghavachari
Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995
1991995
Approximation algorithms for finding highly connected subgraphs
S Khuller
Vertex 2 (2), 8, 1997
1891997
Approximation algorithms for graph augmentation
S Khuller, R Thurimella
Journal of algorithms 14 (2), 214-225, 1993
1841993
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20