关注
Vahid Liaghat
Vahid Liaghat
Department of Management Science & Engineering, Stanford University
在 stanford.edu 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Online prophet-inequality matching with applications to ad allocation
S Alaei, MT Hajiaghayi, V Liaghat
Proceedings of the 13th ACM Conference on Electronic Commerce, 18-35, 2012
1382012
Prophet secretary
H Esfandiari, MT Hajiaghayi, V Liaghat, M Monemizadeh
SIAM Journal on Discrete Mathematics 31 (3), 1685-1701, 2017
1222017
Streaming algorithms for estimating the matching size in planar graphs and beyond
H Esfandiari, M Hajiaghayi, V Liaghat, M Monemizadeh, K Onak
ACM Transactions on Algorithms (TALG) 14 (4), 1-23, 2018
1092018
PACE: Policy-aware application cloud embedding
LE Li, V Liaghat, H Zhao, MT Hajiaghayi, D Li, G Wilfong, YR Yang, C Guo
2013 Proceedings IEEE INFOCOM, 638-646, 2013
722013
The online stochastic generalized assignment problem
S Alaei, MT Hajiaghayi, V Liaghat
International Workshop on Approximation Algorithms for Combinatorial …, 2013
652013
Stochastic k-server: How should Uber work?
S Dehghani, S Ehsani, MT Hajiaghayi, V Liaghat, S Seddighin
arXiv preprint arXiv:1705.05755, 2017
352017
Online node-weighted steiner forest and extensions via disk paintings
MT Hajiaghayi, V Liaghat, D Panigrahi
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 558-567, 2013
272013
Improved approximation algorithms for (budgeted) node-weighted steiner problems
MH Bateni, MT Hajiaghayi, V Liaghat
International Colloquium on Automata, Languages, and Programming, 81-92, 2013
272013
Near-optimal online algorithms for prize-collecting steiner problems
MT Hajiaghayi, V Liaghat, D Panigrahi
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
262014
Colorful paths in vertex coloring of graphs
S Akbari, V Liaghat, A Nikzad
the electronic journal of combinatorics, P17-P17, 2011
222011
Adcell: Ad allocation in cellular networks
S Alaei, MT Hajiaghayi, V Liaghat, D Pei, B Saha
Algorithms–ESA 2011: 19th Annual European Symposium, Saarbrücken, Germany …, 2011
132011
Greedy algorithms for online survivable network design
S Dehghani, S Ehsani, MT Hajiaghayi, V Liaghat, S Seddighin
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
122018
Improved approximation algorithms for (budgeted) node-weighted steiner problems
MH Bateni, MT Hajiaghayi, V Liaghat
SIAM Journal on Computing 47 (4), 1275-1293, 2018
112018
Online degree-bounded steiner network design
S Dehghani, S Ehsani, MT Hajiaghayi, V Liaghat
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
112016
Parameterized complexity of problems in coalitional resource games
R Chitnis, MT Hajiaghayi, V Liaghat
Proceedings of the AAAI Conference on Artificial Intelligence 25 (1), 620-625, 2011
92011
Online stochastic reordering buffer scheduling
H Esfandiari, MT Hajiaghayi, MR Khani, V Liaghat, H Mahini, H Räcke
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
82014
Online weighted degree-bounded steiner networks via novel online mixed packing/covering
S Dehghani, S Ehsani, MT Hajiaghayi, V Liaghat, H Racke, S Seddighin
arXiv preprint arXiv:1704.05811, 2017
72017
Colorful Paths in Vertex Coloring of Graphs.
S Akbari, F Khaghanpoor, S Moazzeni
Ars Comb. 124, 439-447, 2016
72016
Online energy storage management: an algorithmic approach
A Kim, V Liaghat, J Qin, A Saberi
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2016
72016
Online node-weighted steiner forest and extensions via disk paintings
MT Hajiaghayi, V Liaghat, D Panigrahi
SIAM Journal on Computing 46 (3), 911-935, 2017
62017
系统目前无法执行此操作,请稍后再试。
文章 1–20