Martin Pál
Cited by
Cited by
Maximizing a monotone submodular function subject to a matroid constraint
G Calinescu, C Chekuri, M Pal, J Vondrák
SIAM Journal on Computing 40 (6), 1740-1766, 2011
A recursive greedy algorithm for walks in directed graphs
C Chekuri, M Pal
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 245-253, 2005
Proportional fairness in multi-rate wireless LANs
L Li, M Pal, YR Yang
IEEE INFOCOM 2008-The 27th Conference on Computer Communications, 1004-1012, 2008
Contextual multi-armed bandits
T Lu, D Pál, M Pál
Proceedings of the Thirteenth international conference on Artificial …, 2010
Group strategy proof mechanisms via primal-dual algorithms
M Pál, É Tardos
44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003
Boosted sampling: approximation algorithms for stochastic optimization
A Gupta, M Pál, R Ravi, A Sinha
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004
Improved algorithms for orienteering and related problems
C Chekuri, N Korula, M Pál
ACM Transactions on Algorithms (TALG) 8 (3), 1-27, 2012
Budget optimization in search-based advertising auctions
J Feldman, S Muthukrishnan, M Pal, C Stein
Proceedings of the 8th ACM conference on Electronic commerce, 40-49, 2007
Facility location with nonuniform hard capacities
M Pal, T Tardos, T Wexler
Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 329-338, 2001
Sponsored search auctions with markovian users
G Aggarwal, J Feldman, S Muthukrishnan, M Pál
International Workshop on Internet and Network Economics, 621-628, 2008
Online ad assignment with free disposal
J Feldman, N Korula, V Mirrokni, S Muthukrishnan, M Pál
International workshop on internet and network economics, 374-385, 2009
Algorithms for secretary problems on graphs and hypergraphs
N Korula, M Pál
International Colloquium on Automata, Languages, and Programming, 508-520, 2009
Universal facility location
M Mahdian, M Pál
European Symposium on Algorithms, 409-421, 2003
General auction mechanism for search advertising
G Aggarwal, S Muthukrishnan, D Pál, M Pál
Proceedings of the 18th international conference on World wide web, 241-250, 2009
Approximation algorithms for stochastic inventory control models
R Levi, M Pál, RO Roundy, DB Shmoys
Mathematics of Operations Research 32 (2), 284-302, 2007
An online mechanism for ad slot reservations with cancellations
F Constantin, J Feldman, S Muthukrishnan, M Pál
Proceedings of the twentieth annual ACM-SIAM symposium on discrete …, 2009
Approximation via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem
A Gupta, A Kumar, M Pál, T Roughgarden
44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003
Approximation via cost sharing: Simpler and better approximation algorithms for network design
A Gupta, A Kumar, M P´ al, T Roughgarden
Journal of the ACM (JACM) 54 (3), 11-es, 2007
Sampling bounds for stochastic optimization
M Charikar, C Chekuri, M Pál
Approximation, Randomization and Combinatorial Optimization. Algorithms and …, 2005
Stochastic models for budget optimization in search-based advertising
S Muthukrishnan, M Pál, Z Svitkina
International Workshop on Web and Internet Economics, 131-142, 2007
The system can't perform the operation now. Try again later.
Articles 1–20