@article {16850,
	title = {Execution time analysis of a top-down R-tree construction algorithm},
	journal = {Information Processing Letters},
	volume = {101},
	year = {2007},
	month = {2007/01/16/},
	pages = {6 - 12},
	abstract = {A detailed CPU execution-time analysis and implementation are given for a bulk loading algorithm to construct R-trees due to Garc{\'\i}a et al. [Y.J. Garc{\'\i}a, M.A. L{\'o}pez, S.T. Leutenegger, A greedy algorithm for bulk loading R-trees, in: GIS{\textquoteright}98: Proc. of the 6th ACM Intl. Symp. on Advances in Geographic Information Systems, Washington, DC, 1998, pp. 163{\textendash}164] which is known as the top-down greedy split (TGS) bulk loading algorithm. The TGS algorithm makes use of a classical bottom-up packing approach. In addition, an alternative packing approach termed top-down packing is introduced which may lead to improved query performance, and it is shown how to incorporate it into the TGS algorithm. A discussion is also presented of the tradeoffs of using the bottom-up and top-down packing approaches.},
	keywords = {Bulk loading, Data structures, Packing, R-trees, Spatial databases},
	isbn = {0020-0190},
	doi = {10.1016/j.ipl.2006.07.010},
	url = {http://www.sciencedirect.com/science/article/pii/S002001900600233X},
	author = {Alborzi,Houman and Samet, Hanan}
}
@article {17555,
	title = {Approximating low-congestion routing and column-restricted packing problems},
	journal = {Information Processing Letters},
	volume = {74},
	year = {2000},
	month = {2000/04//},
	pages = {19 - 25},
	abstract = {We contribute to a body of research asserting that the fractional and integral optima of column-sparse integer programs are {\textquotedblleft}nearby{\textquotedblright}. This yields improved approximation algorithms for some generalizations of the knapsack problem, with applications to low-congestion routing in networks, file replication in distributed databases, and other packing problems.},
	keywords = {algorithms, Approximation algorithms, integer programming, Packing, Routing},
	isbn = {0020-0190},
	doi = {10.1016/S0020-0190(00)00033-8},
	url = {http://www.sciencedirect.com/science/article/pii/S0020019000000338},
	author = {Baveja,Alok and Srinivasan, Aravind}
}
@article {17560,
	title = {Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems},
	journal = {Mathematics of Operations ResearchMathematics of Operations Research},
	volume = {25},
	year = {2000},
	month = {2000/05/01/},
	pages = {255 - 280},
	abstract = {Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths for these requests. We present improved approximation algorithms and/or integrality gaps for all problems considered; the central theme of this work is the underlying multicommodity flow relaxation. Applications of these techniques to approximating families of packing integer programs are also presented.},
	keywords = {Approximation algorithms, Disjoint paths, integer programming, Linear programming, multicommodity flow, Packing, randomized algorithms, rounding, Routing, unsplittable flow},
	isbn = {0364-765X, 1526-5471},
	doi = {10.1287/moor.25.2.255.12228},
	url = {http://mor.journal.informs.org/content/25/2/255},
	author = {Baveja,Alok and Srinivasan, Aravind}
}
