Buch, Englisch, 212 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 341 g
4th International Workshop, ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised Papers
Buch, Englisch, 212 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 341 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-43977-6
Verlag: Springer
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Grafikprogrammierung
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Zeichen- und Zahlendarstellungen
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Software Engineering
Weitere Infos & Material
ALENEX 2002.- On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs.- A Time-Sensitive System for Black-Box Combinatorial Optimization.- A Compressed Breadth-First Search for Satisfiability.- Using Multi-level Graphs for Timetable Information in Railway Systems.- Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation.- An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web.- The Treewidth of Java Programs.- Partitioning Planar Graphs with Costs and Weights.- Maintaining Dynamic Minimum Spanning Trees: An Experimental Study.- Experimental Evaluation of a New Shortest Path Algorithm.- Getting More from Out-of-Core Columnsort.- Topological Sweep in Degenerate Cases.- Acceleration of K-Means and Related Clustering Algorithms.- STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects.- An Improvement on Tree Selection Sort.
