summaryrefslogtreecommitdiffstats
path: root/paper/main.tex
blob: e25212acc32e675b6db19ec8318aa43bad52706d (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
\documentclass{sig-alternate}
\usepackage[utf8x]{inputenc}
\usepackage{amsmath,amsfonts}
%yaron: removed class amsthm
\usepackage[pagebackref=true,breaklinks=true,colorlinks=true]{hyperref}
\usepackage{algorithmic,algorithm}
\usepackage{booktabs}
\usepackage{graphicx}
\usepackage{bbm}
\usepackage{caption}
\usepackage{subcaption}
\input{definitions}
\begin{document}
%\conferenceinfo{WOODSTOCK}{'97 El Paso, Texas USA}
%\title{Efficient Adaptive Seeding: Leveraging the Friendship
%Paradox for Influence Maximization}

\title{Scalable Methods for Adaptively Seeding a Social Network}
%Paradox for Influence Maximization}

\numberofauthors{2}
\author{
\alignauthor
Thibaut Horel\\
       \affaddr{Harvard University}\\
       \email{thorel@seas.harvard.edu}
\alignauthor
Yaron Singer\\
       \affaddr{Harvard University}\\
       \email{yaron@seas.harvard.edu}
}
\date{}

\maketitle
\begin{abstract}
    \input{sections/abstract}
\end{abstract}

%\category{H.4}{Information Systems Applications}{Miscellaneous}
%\category{D.2.8}{Software Engineering}{Metrics}[complexity measures, performance measures]
%\terms{Theory}
%\keywords{ACM proceedings, \LaTeX, text tagging}

\section{Introduction}
\input{sections/introduction}
\input{sections/related}

\section{Model}
\input{sections/model}

\section{Algorithms}
\input{sections/algorithms}

%\section{The Combinatorial Algorithm}
%\input{sections/combinatorial}

\section{Experiments}
\input{sections/experiments}



\footnotesize{
\bibliographystyle{abbrv}
\bibliography{paper}
%\balancecolumns
%\appendix
%\balancecolumns % GM June 2007
%\input{sections/appendix}
}
\end{document}