000727878 000__ 04801cam\a2200505Ii\4500
000727878 001__ 727878
000727878 005__ 20230306140941.0
000727878 006__ m\\\\\o\\d\\\\\\\\
000727878 007__ cr\cn\nnnunnun
000727878 008__ 150625s2015\\\\sz\a\\\\o\\\\\101\0\eng\d
000727878 020__ $$a9783319200866$$qelectronic book
000727878 020__ $$a3319200860$$qelectronic book
000727878 020__ $$z9783319200859
000727878 0247_ $$a10.1007/978-3-319-20086-6$$2doi
000727878 035__ $$aSP(OCoLC)ocn911623078
000727878 035__ $$aSP(OCoLC)911623078
000727878 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dOCLCO$$dYDXCP$$dUPM$$dVLB
000727878 049__ $$aISEA
000727878 050_4 $$aQA76.9.A43$$bS42 2015eb
000727878 08204 $$a005.1$$223
000727878 1112_ $$aSEA (Symposium)$$n(14th :$$d2015 :$$cParis, France)
000727878 24510 $$aExperimental algorithms$$h[electronic resource] :$$b14th International Symposium, SEA 2015, Paris, France, June 29-July 1, 2015, Proceedings /$$cedited by Evripidis Bampis.
000727878 2463_ $$aSEA 2015
000727878 264_1 $$aCham :$$bSpringer,$$c2015.
000727878 300__ $$a1 online resource (xi, 404 pages) :$$billustrations.
000727878 336__ $$atext$$btxt$$2rdacontent
000727878 337__ $$acomputer$$bc$$2rdamedia
000727878 338__ $$aonline resource$$bcr$$2rdacarrier
000727878 4901_ $$aLecture notes in computer science,$$x0302-9743 ;$$v9125
000727878 4901_ $$aLNCS sublibrary. SL 1, Theoretical computer science and general issues
000727878 500__ $$aInternational conference proceedings.
000727878 500__ $$aIncludes author index.
000727878 5050_ $$aData Structures -- Parallel Construction of Succinct Trees -- Tree Compression with Top Trees Revisited -- A Bulk-Parallel Priority Queue in External Memory with STXXL -- Graph Problems I -- Greedily Improving Our Own Centrality in a Network -- An Exact Algorithm for Diameters of Large Real Directed Graphs -- Graph Partitioning for Independent Sets -- Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments -- Combinatorial Optimization I -- On the Generation of Cutting Planes which Maximize the Bound Improvement -- Separation of Generic Cutting Planes in Branch-and-Price Using a Basis -- On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space -- Scheduling and Allocation -- Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors -- Station Assignment with Reallocation -- Online Knapsack of Unknown Capacity: Energy Optimization for Smartphone Communications -- Combinatorial Optimization II -- Reoptimization Techniques for MIP Solvers -- Submodular Minimization in the Context of Modern LP and MILP Methods and Solvers -- Is Nearly-linear the Same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver -- Efficient and Practical Tree Preconditioning for Solving Laplacian Systems -- Other Applications I -- Efficient Generation of Stable Planar Cages for Chemistry -- Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment -- Solving k-means on High-Dimensional Big Data -- X Contents -- Transportation Networks -- Public Transit Labeling -- On Balanced Separators in Road Networks -- SALT. A Unified Framework for All Shortest-Path Query Variants on Road Networks -- Other Applications II -- Huffman Codes versus Augmented Non-Prefix-Free Codes -- Experimental Analysis of an Online Dictionary Matching Algorithm for Regular Expressions with Gaps -- in Bimatrix Games -- The Effect of Almost-Empty Faces on Planar Kandinsky Drawings -- Graph Problems II -- An Experimental Analysis of a Polynomial Compression for the Steiner Cycle Problem -- On the Quadratic Shortest Path Problem -- A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions.
000727878 506__ $$aAccess limited to authorized users.
000727878 520__ $$aThis book constitutes the refereed proceedings of the 14th International Symposium on Experimental Algorithms, SEA 2015, held in Paris, France, in June/July 2015. The 30 revised full papers presented were carefully reviewed and selected from 76 submissions. The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. The papers are grouped in topical sections on data structures, graph problems, combinatorial optimization, scheduling and allocation, and transportation networks.
000727878 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed June 25, 2015).
000727878 650_0 $$aComputer algorithms$$vCongresses.
000727878 650_0 $$aSoftware engineering$$vCongresses.
000727878 7001_ $$aBampis, Evripidis,$$eeditor.
000727878 830_0 $$aLecture notes in computer science ;$$v9125.
000727878 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
000727878 852__ $$bebk
000727878 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-20086-6$$zOnline Access$$91397441.1
000727878 909CO $$ooai:library.usi.edu:727878$$pGLOBAL_SET
000727878 980__ $$aEBOOK
000727878 980__ $$aBIB
000727878 982__ $$aEbook
000727878 983__ $$aOnline
000727878 994__ $$a92$$bISE