Detailsuche

Mount / Stein

Algorithm Engineering and Experiments

4th International Workshop, ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised Papers
Springer Book Archives
2002. Buch. viii, 212 S.: Bibliographien. Softcover
Springer ISBN 978-3-540-43977-6
Format (B x L): 15,5 x 23,5 cm
Gewicht: 700 g
In englischer Sprache
Das Werk ist Teil der Reihe:
Johnson(AT&TBellLaboratories) CatherineC. McGeoch(AmherstCollege) BernardM. E. Moret(UniversityofNewMexico;chair) JackSnoeyink(UNC-ChapelHill) TableofContents ALENEX2002 OntheImplementationofMST-BasedHeuristicsfortheSteinerProblem inGraphs. 1 M. PoggideArag˜ao,R. F. Werneck(CatholicUniversityof RiodeJaneiro) ATime-SensitiveSystemforBlack-BoxCombinatorialOptimization. 16 V. Phan,P. Sumazin,S. Skiena(SUNYStonyBrook) ACompressedBreadth-FirstSearchforSatis?ability. 29 D. B. Motter,I. L. Markov(UniversityofMichigan) UsingMulti-levelGraphsforTimetableInformationinRailwaySystems. 43 F. Schulz,D. Wagner(UniversityofKonstanz),C. Zaroliagis (UniversityofPatras) EvaluatingtheLocalRatioAlgorithmforDynamicStorageAllocation. 60 K. Pruhs(UniversityofPittsburgh),E. Wiewiora(Universityof California,SanDiego) An Experimental Study of Prefetching and Caching Algorithms for the WorldWideWeb. 71 M. Curcio,S. Leonardi,A. Vitaletti (Universit`adiRoma“LaSapienza”) TheTreewidthofJavaPrograms. 86 J. Gustedt(LORIA&INRIALorraine),O. A. Mæhle,J. A. Telle (UniversityofBergen) PartitioningPlanarGraphswithCostsandWeights. 98 L. Aleksandrov(BulgarianAcademyofSciences,CarletonUniversity), H. Djidjev(UniversityofWarwick),H. Guo,A. Maheshwari (CarletonUniversity) MaintainingDynamicMinimumSpanningTrees:AnExperimentalStudy. 111 G. Cattaneo,P. Faruolo,U. F. Petrillo(Universit`adiSalerno), G. F. Italiano(Universit`adiRoma“TorVergata”) ExperimentalEvaluationofaNewShortestPathAlgorithm. 126 S. Pettie,V. Ramachandran,S. Sridhar(UniversityofTexasatAustin) GettingMorefromOut-of-CoreColumnsort. 143 G. Chaudhry,T. H. Cormen(DartmouthCollege) VIII TableofContents TopologicalSweepinDegenerateCases. 155 E. Rafalin,D. Souvaine(TuftsUniversity),I. Streinu(SmithCollege) AccelerationofK-MeansandRelatedClusteringAlgorithms. 166 S. J. Phillips(AT&TLabs-Research) STAR-Tree:AnE?cientSelf-AdjustingIndexforMovingObjects. 178 C. M. Procopiuc(AT&TResearchLab),P. K. Agarwal (DukeUniversity),S. Har-Peled(UniversityofIllinois) AnImprovementonTreeSelectionSort. 194 J. Chen(BellLabsResearch,Beijing) AuthorIndex. 207 OntheImplementationofMST-Based HeuristicsfortheSteinerProbleminGraphs Marcus Poggi de Arag˜ ao and Renato F. Werneck DepartmentofInformatics,CatholicUniversityofRiodeJaneiro,R. MarquˆesdeS˜ao Vicente,225,RiodeJaneiro,RJ,22453-900,Brazil. poggi@inf. puc-rio. br,rwerneck@cs. princeton. edu Abstract. Someofthemostwidelyusedconstructiveheuristicsforthe Steiner Problem in Graphs are based on algorithms for the Minimum Spanning Tree problem. In this paper, we examine e?cient implem- tations of heuristics based on the classic algorithms by Prim, Kruskal, and Bor? uvka.

Audience

Research

Versandkostenfrei
lieferbar ca. 10 Tage als Sonderdruck ohne Rückgaberecht
74,89 €
inkl. MwSt.
Webcode: beck-shop.de/tdlr
Herausgegeben von: link iconDavid M Mount und link iconClifford Stein