dblp.uni-trier.dewww.uni-trier.de

Daniel Golovin

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
11EEDaniel Golovin, Anupam Gupta, Amit Kumar, Kanat Tangwongsan: All-Norms and All-L_p-Norms Approximation Algorithms. FSTTCS 2008
10EEMatthew J. Streeter, Daniel Golovin: An Online Algorithm for Maximizing Submodular Functions. NIPS 2008: 1577-1584
9EEGuy E. Blelloch, Daniel Golovin, Virginia Vassilevska: Uniquely Represented Data Structures for Computational Geometry. SWAT 2008: 17-28
2007
8 Matthew J. Streeter, Daniel Golovin, Stephen F. Smith: Combining Multiple Heuristics Online. AAAI 2007: 1197-1203
7 Matthew J. Streeter, Daniel Golovin, Stephen F. Smith: Restart Schedules for Ensembles of Problem Instances. AAAI 2007: 1204-1210
6EEDaniel Golovin: Stochastic packing-market planning. ACM Conference on Electronic Commerce 2007: 172-181
5EEGuy E. Blelloch, Daniel Golovin: Strongly History-Independent Hashing with Applications. FOCS 2007: 272-282
4EEDaniel Golovin: More expressive market models and the future of combinatorial auctions. SIGecom Exchanges 7(1): 55-57 (2007)
2006
3EEDaniel Golovin, Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter: Quorum placement in networks: minimizing network congestion. PODC 2006: 16-25
2EEDaniel Golovin, Viswanath Nagarajan, Mohit Singh: Approximating the k-multicut problem. SODA 2006: 621-630
1EEDaniel Golovin, Vineet Goyal, R. Ravi: Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems. STACS 2006: 206-217

Coauthor Index

1Guy E. Blelloch [5] [9]
2Vineet Goyal [1]
3Anupam Gupta [3] [11]
4Amit Kumar [11]
5Bruce M. Maggs [3]
6Viswanath Nagarajan [2]
7Florian Oprea [3]
8R. Ravi [1]
9Michael K. Reiter [3]
10Mohit Singh [2]
11Stephen F. Smith [7] [8]
12Matthew J. Streeter [7] [8] [10]
13Kanat Tangwongsan [11]
14Virginia Vassilevska [9]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)