Algorithm Engineering and Experimentation
RobertoGrossi JopSibeyn FrancBrglez DavidJohnson RobertoSolis-Oba KenClarkson JuhaKAu arkkAu ainen ThomasWillhalm SabineCornelsen BernardMoret ALENEXSteeringCommittee RobertoBattiti(UniversityofTrento, Italy) AndrewV. Goldberg(IntertrustSTARLab) MichaelT. Goodrich(JohnsHopkinsUniversity) DavidS. Johnson(ATaTBellLaboratories) CatherineC. McGeoch(AmherstCollege) BernardM. E. Moret(UniversityofNewMexico, chair) TableofContents ALENEX'01 SolvingaaHardaProblemtoApproximateanaEasyaOne:Heuristicsfor MaximumMatchingsandMaximumTravelingSalesmanProblems. . . . . . . 1 S. P. Fekete (TU Berlin), H. Meijer (Queen's University), A. Rohe (UniversitAu atBonn), andW. Tietze(TUBerlin) CNOPaAPackageforConstrainedNetworkOptimization. . . . . . . . . . . . . 17 K. MehlhornandM. Ziegelmann(MPISaarbrucken) Au TheAsymmetricTravelingSalesmanProblem: Algorithms, InstanceGenerators, andTests. . . . . . . . . . . . . . . . . . . . . . . . . . . 32 J. Cirasella (Boston Arch. Center Library), D. S. Johnson (ATaT), L. A. McGeoch, (AmherstCollege), andW. Zhang(WUSTL) NetworkTomographythroughEnd-to-EndMeasurements . . . . . . . . . . . . . . 60 D. Towsley(UMass. , Amherst) ExperimentalResultsonStatisticalApproaches toPageReplacementPolicies. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 V. Leung (Sandia National Laboratories) and S. Irani (University of California, Irvine) EstimatingResemblanceofMIDIDocuments. . . . . . . . . . . . . . . . . . . . . . . . . . 78 M. MitzenmacherandS. Owen(Harvard) ExperimentsonAdaptiveSetIntersectionsforTextRetrievalSystems. . . . 91 E. D. Demaine(UWaterloo), A. LAa opez-Ortiz(Univ. ofNewBrunswick), andJ. I. Munro(UWaterloo) PVD:AStableImplementationforComputingVoronoiDiagrams ofPolygonalPockets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105 S. Sethia, M. Held, andJ. S. B. Mitchell(SUNYStonyBrook) HierarchicalClusteringofTrees:AlgorithmsandExperiments. . . . . . . . . . . 117 I. FinocchiandR. Petreschi(Universit`adiRomaaLaSapienzaa) TravelPlanningwithSelf-MadeMaps. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 132 U. Brandes, F. Schulz, D. Wagner, and T.of the chart approximates the relative frequency, and the density of the chart is indicative of the number of queries with that ... 100 1000 10000 100000 Adaptive intersection 1000 10000 100000 1e+06 Pairwise two-smallest binary-searchanbsp;...
| Title | : | Algorithm Engineering and Experimentation |
| Author | : | Adam L. Buchsbaum, Jack Snoeyink |
| Publisher | : | Springer Science & Business Media - 2001-09-12 |
You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.
Once you have finished the sign-up process, you will be redirected to your download Book page.
How it works:- 1. Register a free 1 month Trial Account.
- 2. Download as many books as you like (Personal use)
- 3. Cancel the membership at any time if not satisfied.
