Algorithm Engineering and Experimentation: Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers (Lecture Notes in Computer Science)

0 avg rating
( 0 ratings by Goodreads )
 
9783540425601: Algorithm Engineering and Experimentation: Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers (Lecture Notes in Computer Science)
View all copies of this ISBN edition:
 
 

This book constitutes the thoroughly refereed post-proceedings of the Third International Workshop on Algorithm Engineering and Experimentation, ALENEX 2001, held in Washington, DC, USA in January 2001. The 15 revised full papers presented together with the abstracts of three invited presentations have gone through two rounds of reviewing and revision and were selected from 31 submissions. Among the topics addressed are heuristics for approximation, network optimization, TSP, randomization, sorting, information retrieval, graph computations, tree clustering, scheduling, network algorithms, point set computations, searching, and data mining.

"synopsis" may belong to another edition of this title.

Top Search Results from the AbeBooks Marketplace

1.

Adam L. Buchsbaum (Editor), Jack Snoeyink (Editor)
Published by Springer (2001)
ISBN 10: 3540425608 ISBN 13: 9783540425601
New Paperback Quantity Available: 1
Seller:
Ergodebooks
(RICHMOND, TX, U.S.A.)
Rating
[?]

Book Description Springer, 2001. Paperback. Condition: New. 2001. Seller Inventory # DADAX3540425608

More information about this seller | Contact this seller

Buy New
US$ 45.55
Convert currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

2.

Published by Springer (2001)
ISBN 10: 3540425608 ISBN 13: 9783540425601
New Softcover Quantity Available: 1
Seller:
Irish Booksellers
(Portland, ME, U.S.A.)
Rating
[?]

Book Description Springer, 2001. Condition: New. book. Seller Inventory # M3540425608

More information about this seller | Contact this seller

Buy New
US$ 61.34
Convert currency

Add to Basket

Shipping: US$ 3.27
Within U.S.A.
Destination, rates & speeds

3.

ADAM L. BUCHSBAUM
Published by Springer (2001)
ISBN 10: 3540425608 ISBN 13: 9783540425601
New Paperback Quantity Available: 1
Seller:
Herb Tandree Philosophy Books
(Stroud, GLOS, United Kingdom)
Rating
[?]

Book Description Springer, 2001. Paperback. Condition: NEW. 9783540425601 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. For all enquiries, please contact Herb Tandree Philosophy Books directly - customer service is our primary goal. Seller Inventory # HTANDREE0335001

More information about this seller | Contact this seller

Buy New
US$ 84.74
Convert currency

Add to Basket

Shipping: US$ 10.42
From United Kingdom to U.S.A.
Destination, rates & speeds

4.

Buchsbaum, Adam L.
Published by Springer-Verlag Berlin and Heidelberg GmbH and Co. KG (2001)
ISBN 10: 3540425608 ISBN 13: 9783540425601
New Quantity Available: > 20
Print on Demand
Seller:
Pbshop
(Wood Dale, IL, U.S.A.)
Rating
[?]

Book Description Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, 2001. PAP. Condition: New. New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9783540425601

More information about this seller | Contact this seller

Buy New
US$ 96.11
Convert currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

5.

Published by Springer (2001)
ISBN 10: 3540425608 ISBN 13: 9783540425601
New Softcover Quantity Available: 15
Print on Demand
Seller:
Rating
[?]

Book Description Springer, 2001. Condition: New. This item is printed on demand for shipment within 3 working days. Seller Inventory # LP9783540425601

More information about this seller | Contact this seller

Buy New
US$ 98.85
Convert currency

Add to Basket

Shipping: US$ 3.51
From Germany to U.S.A.
Destination, rates & speeds

6.

Adam L. Buchsbaum
Published by Springer-Verlag Berlin and Heidelberg GmbH and Co. KG (2001)
ISBN 10: 3540425608 ISBN 13: 9783540425601
New Quantity Available: > 20
Print on Demand
Seller:
Books2Anywhere
(Fairford, GLOS, United Kingdom)
Rating
[?]

Book Description Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, 2001. PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # LQ-9783540425601

More information about this seller | Contact this seller

Buy New
US$ 96.43
Convert currency

Add to Basket

Shipping: US$ 11.75
From United Kingdom to U.S.A.
Destination, rates & speeds

7.

ISBN 10: 3540425608 ISBN 13: 9783540425601
New Quantity Available: 5
Seller:
ReadWhiz
(Portland, OR, U.S.A.)
Rating
[?]

Book Description Condition: New. Seller Inventory # ria9783540425601_ing

More information about this seller | Contact this seller

Buy New
US$ 111.92
Convert currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, rates & speeds

8.

Published by Springer
ISBN 10: 3540425608 ISBN 13: 9783540425601
New Paperback Quantity Available: > 20
Seller:
BuySomeBooks
(Las Vegas, NV, U.S.A.)
Rating
[?]

Book Description Springer. Paperback. Condition: New. 236 pages. Dimensions: 9.2in. x 6.1in. x 0.6in.The aim of the annual Workshop on Algorithm Engineering and Experiments (ALENEX)istoprovideaforumforthepresentationoforiginalresearch inthe implementationandexperimentalevaluationofalgorithmsanddatastructures. ALENEX2001, thethirdintheseries, washeldinWashington, DC, onJanuary 56, 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 Thefollowingprovideddirectnancialsupport, whichenabledustohostinvited speakersandprovidereducedregistrationfeestostudents. DIMACSSpecialFocusonNextGenerationNetworks TheHopkinsCenterforAlgorithmEngineering NECResearchInstitute Thefollowingprovidedin-kindsupport, facilitatingtheworkshop. AT and T SIAM, theSocietyforIndustrialandAppliedMathematics SIGACT, theACMSIGonAlgorithmsandComputationTheory ALENEX2001ProgramCommittee NinaAmenta, (UniversityofTexas, Austin) AdamBuchsbaum, (AT and TLabsResearch;Co-chair) RudolfFleischer, (HongKongUniversityofScience and Technology) LyleMcGeoch, (AmherstCollege) S. Muthukrishnan, (AT and TLabsResearch) JackSnoeyink, (UniversityofNorthCarolina, ChapelHill;Co-chair) MattStallmann(NorthCarolinaStateUniversity) DorotheaWagner(Universit atKonstanz) VI Preface ALENEX01ExternalReviewers SunilArya RolfDrechsler MarinaPapatriantalou LydiaAyers LeszekGasieniec FrankSchulz ThereseBiedl RaaeleGiancarlo 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 and TBellLaboratories) CatherineC. McGeoch(AmherstCollege) BernardM. E. Moret(UniversityofNewMexico, chair) TableofContents ALENEX01 SolvingaHardProblemtoApproximateanEasyOne: Heuristicsfor MaximumMatchingsandMaximumTravelingSalesmanProblems. . . . . . . 1 S. P. Fekete (TU Berlin), H. Meijer (Queens University), A. Rohe (Universit atBonn), andW. Tietze(TUBerlin) CNOPAPackageforConstrainedNetworkOptimization. . . . . . . . . . . . . 17 K. MehlhornandM. Ziegelmann(MPISaarbrucken) TheAsymmetricTravelingSalesmanProblem: Algorithms, InstanceGenerators, andTests. . . . . . . . . . . . . . . . . . . . . . . . . . . 32 J. Cirasella (Boston Arch. Center Library), D. S. Johnson (AT and 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(UniversitadiRomaLaSapienza) TravelPlanningwit This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN. Paperback. Seller Inventory # 9783540425601

More information about this seller | Contact this seller

Buy New
US$ 131.96
Convert currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, rates & speeds

9.

Published by Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Germany (2001)
ISBN 10: 3540425608 ISBN 13: 9783540425601
New Paperback Quantity Available: 10
Seller:
The Book Depository EURO
(London, United Kingdom)
Rating
[?]

Book Description Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Germany, 2001. Paperback. Condition: New. 2001 ed.. Language: English. Brand new Book. The aim of the annual Workshop on Algorithm Engineering and Experiments (ALENEX)istoprovideaforumforthepresentationoforiginalresearchinthe implementationandexperimentalevaluationofalgorithmsanddatastructur es. 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 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. Seller Inventory # AAV9783540425601

More information about this seller | Contact this seller

Buy New
US$ 137.60
Convert currency

Add to Basket

Shipping: US$ 3.92
From United Kingdom to U.S.A.
Destination, rates & speeds

10.

Buchsbaum, A. L. (Editor)/ Snoeyink, Jack (Editor)
Published by Springer Verlag (2001)
ISBN 10: 3540425608 ISBN 13: 9783540425601
New Paperback Quantity Available: 2
Seller:
Revaluation Books
(Exeter, United Kingdom)
Rating
[?]

Book Description Springer Verlag, 2001. Paperback. Condition: Brand New. 1st edition. 231 pages. 9.00x6.00x0.50 inches. In Stock. Seller Inventory # x-3540425608

More information about this seller | Contact this seller

Buy New
US$ 134.60
Convert currency

Add to Basket

Shipping: US$ 9.79
From United Kingdom to U.S.A.
Destination, rates & speeds

There are more copies of this book

View all search results for this book