The SCEAS System
| |||||||

## Search the dblp DataBase
Martin Pál:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Moses Charikar, Chandra Chekuri, Martin Pál
**Sampling Bounds for Stochastic Optimization.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:257-269 [Conf] - Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha
**What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:86-98 [Conf] - Chandra Chekuri, Martin Pál
**An**[Citation Graph (0, 0)][DBLP]*O*(log*n*) Approximation Ratio for the Asymmetric Traveling Salesman*Path*Problem. APPROX-RANDOM, 2006, pp:95-103 [Conf] - Ara Hayrapetyan, David Kempe, Martin Pál, Zoya Svitkina
**Unbalanced Graph Cuts.**[Citation Graph (0, 0)][DBLP] ESA, 2005, pp:191-202 [Conf] - Mohammad Mahdian, Martin Pál
**Universal Facility Location.**[Citation Graph (0, 0)][DBLP] ESA, 2003, pp:409-421 [Conf] - Chandra Chekuri, Martin Pál
**A Recursive Greedy Algorithm for Walks in Directed Graphs.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:245-253 [Conf] - Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden
**Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem.**[Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:606-0 [Conf] - Martin Pál, Éva Tardos
**Group Strategyproof Mechanisms via Primal-Dual Algorithms.**[Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:584-593 [Conf] - Martin Pál, Éva Tardos, Tom Wexler
**Facility Location with Nonuniform Hard Capacities.**[Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:329-338 [Conf] - Anupam Gupta, Martin Pál
**Stochastic Steiner Trees Without a Root.**[Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:1051-1063 [Conf] - Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys
**Approximation Algorithms for Stochastic Inventory Control Models.**[Citation Graph (0, 0)][DBLP] IPCO, 2005, pp:306-320 [Conf] - Hubie Chen, Martin Pál
**Optimization, Games, and Quantified Constraint Satisfaction.**[Citation Graph (0, 0)][DBLP] MFCS, 2004, pp:239-250 [Conf] - Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál
**Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:375-384 [Conf] - Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha
**Boosted sampling: approximation algorithms for stochastic optimization.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:417-426 [Conf] - Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák
**Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract).**[Citation Graph (0, 0)][DBLP] IPCO, 2007, pp:182-196 [Conf] - Jon Feldman, S. Muthukrishnan, Martin Pal, Clifford Stein
**Budget optimization in search-based advertising auctions.**[Citation Graph (0, 0)][DBLP] ACM Conference on Electronic Commerce, 2007, pp:40-49 [Conf] - Jon Feldman, S. Muthukrishnan, Martin Pal, Clifford Stein
**Budget Optimization in Search-Based Advertising Auctions**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - S. Muthukrishnan, Martin Pal, Zoya Svitkina
**Stochastic Models for Budget Optimization in Search-Based Advertising**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden
**Approximation via cost sharing: Simpler and better approximation algorithms for network design.**[Citation Graph (0, 0)][DBLP] J. ACM, 2007, v:54, n:3, pp:11- [Journal] - Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál
**Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy.**[Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal] **Algorithms for Secretary Problems on Graphs and Hypergraphs.**[Citation Graph (, )][DBLP]**Improved algorithms for orienteering and related problems.**[Citation Graph (, )][DBLP]**An online mechanism for ad slot reservations with cancellations.**[Citation Graph (, )][DBLP]**Online Ad Assignment with Free Disposal.**[Citation Graph (, )][DBLP]**Stochastic Models for Budget Optimization in Search-Based Advertising.**[Citation Graph (, )][DBLP]**Sponsored Search Auctions with Markovian Users.**[Citation Graph (, )][DBLP]**General auction mechanism for search advertising.**[Citation Graph (, )][DBLP]**A Truthful Mechanism for Offline Ad Slot Scheduling.**[Citation Graph (, )][DBLP]**General Auction Mechanism for Search Advertising**[Citation Graph (, )][DBLP]
Search in 0.100secs, Finished in 0.101secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |