Các bài viết có thể truy cập công khai - Viswanath NagarajanTìm hiểu thêm
Có tại một số nơi: 33
Approximation algorithms for optimal decision trees and adaptive TSP problems
A Gupta, V Nagarajan, R Ravi
Mathematics of Operations Research 42 (3), 876-896, 2017
Các cơ quan ủy nhiệm: US National Science Foundation
Algorithms and adaptivity gaps for stochastic probing
A Gupta, V Nagarajan, S Singla
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
Các cơ quan ủy nhiệm: US National Science Foundation
Online algorithms for covering and packing problems with convex objectives
Y Azar, N Buchbinder, THH Chan, S Chen, IR Cohen, A Gupta, Z Huang, ...
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
Các cơ quan ủy nhiệm: US National Science Foundation, Research Grants Council, Hong Kong
Adaptivity gaps for stochastic probing: Submodular and XOS functions
A Gupta, V Nagarajan, S Singla
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
Các cơ quan ủy nhiệm: US National Science Foundation
Minimum latency submodular cover
S Im, V Nagarajan, RVD Zwaan
ACM Transactions on Algorithms (TALG) 13 (1), 1-28, 2016
Các cơ quan ủy nhiệm: US National Science Foundation
On the adaptivity gap of stochastic orienteering
N Bansal, V Nagarajan
Mathematical Programming 154, 145-172, 2015
Các cơ quan ủy nhiệm: Netherlands Organisation for Scientific Research, European Commission
Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
R Ghuge, V Nagarajan
Mathematics of Operations Research 47 (2), 1612-1630, 2022
Các cơ quan ủy nhiệm: US National Science Foundation
Minimum makespan multi-vehicle dial-a-ride
IL Gørtz, V Nagarajan, R Ravi
ACM Transactions on Algorithms (TALG) 11 (3), 1-29, 2015
Các cơ quan ủy nhiệm: Danish Council for Independent Research
Approximation algorithms for inventory problems with submodular or routing costs
V Nagarajan, C Shi
Mathematical Programming 160, 225-244, 2016
Các cơ quan ủy nhiệm: US National Science Foundation
Stochastic load balancing on unrelated machines
A Gupta, A Kumar, V Nagarajan, X Shen
Mathematics of Operations Research 46 (1), 115-133, 2021
Các cơ quan ủy nhiệm: US National Science Foundation
Adaptive submodular ranking and routing
F Navidi, P Kambadur, V Nagarajan
Operations Research 68 (3), 856-877, 2020
Các cơ quan ủy nhiệm: US National Science Foundation
The Euclidean k-Supplier Problem
V Nagarajan, B Schieber, H Shachnai
Mathematics of Operations Research 45 (1), 1-14, 2020
Các cơ quan ủy nhiệm: US National Science Foundation
Algorithms for hub label optimization
M Babenko, AV Goldberg, A Gupta, V Nagarajan
ACM Transactions on Algorithms (TALG) 13 (1), 1-17, 2016
Các cơ quan ủy nhiệm: US National Science Foundation
An approximation algorithm for vehicle routing with compatibility constraints
M Yu, V Nagarajan, S Shen
Operations Research Letters 46 (6), 579-584, 2018
Các cơ quan ủy nhiệm: US National Science Foundation
Online covering with -norm objectives and applications to network design
X Shen, V Nagarajan
Mathematical Programming 184 (1), 155-182, 2020
Các cơ quan ủy nhiệm: US National Science Foundation
Approximating graph-constrained max-cut
X Shen, J Lee, V Nagarajan
Mathematical Programming 172, 35-58, 2018
Các cơ quan ủy nhiệm: US National Science Foundation, US Department of Defense
Capacitated vehicle routing with nonuniform speeds
IL Gørtz, M Molinaro, V Nagarajan, R Ravi
Mathematics of Operations Research 41 (1), 318-331, 2016
Các cơ quan ủy nhiệm: US National Science Foundation, Danish Council for Independent Research
Efficient algorithms for stochastic ride-pooling assignment with mixed fleets
Q Luo, V Nagarajan, A Sundt, Y Yin, J Vincent, M Shahabi
Transportation science 57 (4), 908-936, 2023
Các cơ quan ủy nhiệm: US National Science Foundation
Optimal decision tree with noisy outcomes
S Jia, F Navidi, R Ravi
Advances in neural information processing systems 32, 2019
Các cơ quan ủy nhiệm: US National Science Foundation
Batched dueling bandits
A Agarwal, R Ghuge, V Nagarajan
International Conference on Machine Learning, 89-110, 2022
Các cơ quan ủy nhiệm: US National Science Foundation
Chương trình máy tính sẽ tự động xác định thông tin xuất bản và thông tin về nhà tài trợ