Order Total (1 Item Items):
Shipping Destination:
Algorithm Engineering Experimentation Third (12 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (12)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (8)
- As New, Fine or Near Fine (2)
- Very Good or Good (1)
- Fair or Poor (No further results match this refinement)
- As Described (1)
Binding
- All Bindings
- Hardcover (No further results match this refinement)
- Softcover (12)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (5)
- Not Print on Demand (12)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Algorithm Engineering and Experimentation. Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers.
Seller: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Germany
Association Member: GIAQ ILAB VDA
Seller rating 5 out of 5 stars
VIII, 229 p. Softcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Lecture Notes in Computer Science, Vol. 2153. Sprache: Englisch.
-
Paperback. Condition: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments.
-
-
-
Condition: As New. Unread book in perfect condition.
-
-
Algorithm Engineering and Experimentation: Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers (Lecture Notes in Computer Science, 2153)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 68.54
US$ 16.17 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
US$ 66.18
US$ 20.91 shipping
Ships from United Kingdom to U.S.A.Quantity: 10 available
Add to basketPF. Condition: New.
-
Algorithm Engineering and Experimentation : Third International Workshop, Alenex 2001, Washington, Dc, Usa, January 5-6, 2001, Revised Papers
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 68.53
US$ 20.25 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Algorithm Engineering and Experimentation : Third International Workshop, Alenex 2001, Washington, Dc, Usa, January 5-6, 2001, Revised Papers
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 76.56
US$ 20.25 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
US$ 90.38
US$ 13.50 shipping
Ships from United Kingdom to U.S.A.Quantity: 2 available
Add to basketPaperback. Condition: Brand New. 1st edition. 231 pages. 9.00x6.00x0.50 inches. In Stock.
-
Algorithm Engineering and Experimentation : Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers
Language: English
Published by Springer Berlin Heidelberg, 2001
ISBN 10: 3540425608 ISBN 13: 9783540425601
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - The aim of the annual Workshop on Algorithm Engineering and Experiments (ALENEX)istoprovideaforumforthepresentationoforiginalresearchinthe implementationandexperimentalevaluationofalgorithmsanddatastructures. ALENEX2001,thethirdintheseries,washeldinWashington,DC,onJanuary 5 6, 2001. This volume collects extended versions of the 15 papers that were selected for presentation from a pool of 31 submissions. It also includes the abstracts from the three invited speakers, who were supported by DIMACS SpecialFocusonNextGenerationNetworks. Wewouldliketotakethisopportunitytothankthesponsors,authors,and reviewers that made ALENEX 2001 a success. We would also like to thank Springer-Verlag for publishing these papers in their series ofLecture Notes in ComputerScience. June2001 AdamBuchsbaum JackSnoeyink ALENEX2001Sponsors Thefollowingprovideddirect nancialsupport,whichenabledustohostinvited speakersandprovidereducedregistrationfeestostudents. DIMACSSpecialFocusonNextGenerationNetworks TheHopkinsCenterforAlgorithmEngineering NECResearchInstitute Thefollowingprovidedin-kindsupport,facilitatingtheworkshop. AT&T SIAM,theSocietyforIndustrialandAppliedMathematics SIGACT,theACMSIGonAlgorithmsandComputationTheory ALENEX2001ProgramCommittee NinaAmenta,(UniversityofTexas,Austin) AdamBuchsbaum,(AT&TLabs Research;Co-chair) RudolfFleischer,(HongKongUniversityofScience&Technology) LyleMcGeoch,(AmherstCollege) S. Muthukrishnan,(AT&TLabs Research) JackSnoeyink,(UniversityofNorthCarolina,ChapelHill;Co-chair) MattStallmann(NorthCarolinaStateUniversity) DorotheaWagner(Universit atKonstanz) VI Preface ALENEX 01ExternalReviewers SunilArya RolfDrechsler MarinaPapatrianta lou LydiaAyers LeszekGasieniec FrankSchulz ThereseBiedl Ra aeleGiancarlo MichaelSeel UlrikBrandes RobertoGrossi JopSibeyn FrancBrglez DavidJohnson RobertoSolis-Oba KenClarkson JuhaK arkk ainen ThomasWillhalm SabineCornelsen BernardMoret ALENEXSteeringCommittee RobertoBattiti(UniversityofTrento,Italy) AndrewV. Goldberg(IntertrustSTARLab) MichaelT. Goodrich(JohnsHopkinsUniversity) DavidS. Johnson(AT&TBellLaboratories) CatherineC. McGeoch(AmherstCollege) BernardM. E. Moret(UniversityofNewMexico,chair) TableofContents ALENEX 01 Solvinga Hard ProblemtoApproximatean Easy One:Heuristicsfor MaximumMatchingsandMaximumTravelingSalesmanProblems. . . . . . . 1 S. P. Fekete (TU Berlin), H. Meijer (Queen s University), A. Rohe (Universit atBonn),andW. Tietze(TUBerlin) CNOP APackageforConstrainedNetworkOptimization. . . . . . . . . . . . . 17 K. MehlhornandM. Ziegelmann(MPISaarbrucken) TheAsymmetricTravelingSalesmanProblem: Algorithms,InstanceGenerators,andTests. . . . . . . . . . . . . . . . . . . . . . . . . . . 32 J. Cirasella (Boston Arch. Center Library), D. S. Johnson (AT&T), 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. L 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`adiRoma LaSapienza ) TravelPlanningwithSelf-MadeMaps. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 132 U. Brandes, F. Schulz, D. Wagner, and T.
