Timeline for Understanding efficiency vs reliability trade offs in a phone tree design
Current License: CC BY-SA 2.5
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 30, 2012 at 4:21 | vote | accept | utunga | ||
Apr 30, 2012 at 4:21 | vote | accept | utunga | ||
Apr 30, 2012 at 4:21 | |||||
Mar 11, 2011 at 0:00 | answer | added | Konstantinos Panagiotou | timeline score: 1 | |
Mar 7, 2011 at 9:05 | comment | added | Sam Nead | Hmmm. Furthermore, a binary tree is easier to design and maintain. I suppose that updating the expander graph could be done by computer... Is there an app for that? | |
Mar 7, 2011 at 9:02 | comment | added | Sam Nead | A low valency expander graph is a good solution. However you'd have to give instructions different from the ones I was given when I on a phone trees (usually binary, and a long time ago). We were told that we were responsible for the people below us on the tree. In an expander call graph the edges wouldn't be directed -- so you would have to tell each vertex "You are responsible for making sure these three vertices are contacted." | |
Mar 7, 2011 at 7:56 | comment | added | Douglas Zare | You may want to look at expander graphs, which give exponential growth (up to a point) of the number of people contacted. en.wikipedia.org/wiki/Expander_graph cs.huji.ac.il/~nati/PAPERS/expander_survey.pdf | |
Mar 7, 2011 at 6:41 | history | asked | utunga | CC BY-SA 2.5 |