summaryrefslogtreecommitdiffstats
path: root/papers.bib
blob: d6cbbc9c339dcc0bfd707f59c6e48bf19797924f (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
@inproceedings{cm,
  author    = {David Kempe and
               Mohammad Mahdian},
  title     = {A Cascade Model for Externalities in Sponsored Search},
  booktitle = {WINE},
  year      = {2008},
  pages     = {585-596},
  ee        = {http://dx.doi.org/10.1007/978-3-540-92185-1_65},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}



@inproceedings{oad,
  author    = {Anirban Dasgupta and
               Arpita Ghosh and
               Hamid Nazerzadeh and
               Prabhakar Raghavan},
  title     = {Online story scheduling in web advertising},
  booktitle = {SODA},
  year      = {2009},
  pages     = {1275-1284},
  ee        = {http://doi.acm.org/10.1145/1496770.1496908},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@proceedings{DBLP:conf/soda/2009,
  editor    = {Claire Mathieu},
  title     = {Proceedings of the Twentieth Annual ACM-SIAM Symposium on
               Discrete Algorithms, SODA 2009, New York, NY, USA, January
               4-6, 2009},
  booktitle = {SODA},
  publisher = {SIAM},
  year      = {2009},
  ee        = {http://dl.acm.org/citation.cfm?id=1496770},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@proceedings{DBLP:conf/wine/2008,
  editor    = {Christos H. Papadimitriou and
               Shuzhong Zhang},
  title     = {Internet and Network Economics, 4th International Workshop,
               WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings},
  booktitle = {WINE},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {5385},
  year      = {2008},
  isbn      = {978-3-540-92184-4},
  ee        = {http://dx.doi.org/10.1007/978-3-540-92185-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{Johnson:PCKP,
  author = {Johnson, D. S. and Niemi, K. A.},
  interhash = {c23744607ef3ff3bf587030dda6cc6db},
  intrahash = {06a17ed7c91bf8af5444c70137ec774c},
  journal = {MATHEMATICS OF OPERATIONS RESEARCH},
  number = 1,
  pages = {1-14},
  title = {On Knapsacks, Partitions, and a New Dynamic
Programming Technique for Trees},
  volume = 8,
  year = 1983,
}

@article{DBLP:journals/telsys/ShawCC97,
  author    = {Dong X. Shaw and
               Geon Cho and
               Hsuliang Chang},
  title     = {A depth-first dynamic programming procedure for the extended
               tree knapsack problem in local access network design},
  journal   = {Telecommunication Systems},
  volume    = {7},
  number    = {1-3},
  year      = {1997},
  pages     = {29-43},
  ee        = {http://dx.doi.org/10.1023/A:1019103824623},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}