Experimental Algorithms : 12th International Symposium, SEA 2013, Rome, Italy, June 5-7, 2013. Proceedings
This book constitutes the refereed proceedings of the 12th International Symposium on Experimental Algorithms, SEA 2013, held in Rome, Italy, in June 2013. The 32 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 73 submissions. The papers are org...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Další autoři: | , |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| Edice: | Theoretical Computer Science and General Issues
7933 |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme de l'éditeur (Springer) Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Experimental Algorithms, Texte imprimé, 9783642385261 • Experimental Algorithms, Texte imprimé, 9783642385285 |
| LEADER | 04969nam a22003617a 4500 | ||
|---|---|---|---|
| 001 | 946650 | ||
| 008 | 130704q2000 xx ||| |||| 00| 0 eng d | ||
| 009 | PPN170492273 | ||
| 020 | |a 9783642385278 | ||
| 041 | 0 | |a eng | |
| 082 | |a 005.1 | ||
| 100 | 1 | |a Bonifaci, Vincenzo. | |
| 245 | 1 | 0 | |a Experimental Algorithms : |b 12th International Symposium, SEA 2013, Rome, Italy, June 5-7, 2013. Proceedings |c edited by Vincenzo Bonifaci, Camil Demetrescu, Alberto Marchetti-Spaccamela. |
| 260 | |a Berlin, Heidelberg : |b Springer Berlin Heidelberg. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Theoretical Computer Science and General Issues |v 7933 |x 2512-2029 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Algorithms and Linear Programming Relaxations for Scheduling Unrelated Parallel Machines.- The Hub Labeling Algorithm.- Design of Practical Succinct Data Structures for Large Data Collections.- Hub Label Compression.- Faster Customization of Road Networks.- Intriguingly Simple and Fast Transit Routing.- Transit Node Routing Reconsidered.- A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions.- Computational Aspects of Ordered Integer Partition with Upper Bounds.- Hypergraph Transversal Computation with Binary Decision Diagrams.- Efficient Counting of Maximal Independent Sets in Sparse Graphs -- An Edge Quadtree for External Memory.- Branchless Search Programs.- Lightweight Lempel-Ziv Parsing.- Space-Efficient, High-Performance Rank and Select Structures on Uncompressed Bit Sequences -- Think Locally, Act Globally: Highly Balanced Graph Partitioning.- Evaluation of ILP-Based Approaches for Partitioning into Colorful Components -- Finding Modules in Networks with Non-modular Regions.- Telling Stories Fast: Via Linear-Time Delay Pitch Enumeration -- Undercover Branching.- Quadratic Outer Approximation for Convex Integer Programming with Box Constraints -- Separable Non-convex Underestimators for Binary Quadratic Programming.- Hybrid SDP Bounding Procedure.- Computing Multimodal Journeys in Practice.- Efficient Computation of Jogging Routes.- Dominator Certification and Independent Spanning Trees: An Experimental Study.- Novel Techniques for Automorphism Group Computation.- Blinking Molecule Tracking.- The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm.- An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number.- In-Out Separation and Column Generation Stabilization by Dual Price Smoothing.- Energy Minimization via a Primal-Dual Algorithm for a Convex Program -- Reoptimization in Branch-and-Bound Algorithms with an Application to Elevator Control.- Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows.- Finding Robust Solutions for the Stochastic Job Shop Scheduling Problem by Including Simulation in Local Search. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a This book constitutes the refereed proceedings of the 12th International Symposium on Experimental Algorithms, SEA 2013, held in Rome, Italy, in June 2013. The 32 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 73 submissions. The papers are organized in topical sections on transportation networks and graph algorithms, combinatorics and enumeration, data structures and compression, network partitioning and bioinformatics, mathematical programming, geometry and optimization, and scheduling and local search. | ||
| 700 | 1 | |a Demetrescu, Camil. |4 pbd | |
| 700 | 1 | |a Marchetti-Spaccamela, Alberto. |4 pbd | |
| 776 | 0 | |t Experimental Algorithms |b Texte imprimé |z 9783642385261 | |
| 776 | 0 | |t Experimental Algorithms |b Texte imprimé |z 9783642385285 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/978-3-642-38527-8 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://doi.org/10.1007/978-3-642-38527-8 |z Accès sur la plateforme de l'éditeur (Springer) | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-MB0RZM83-0 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747821208 |u https://ezproxy.univ-orleans.fr/login?url=https://dx.doi.org/10.1007/978-3-642-38527-8 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750837950 |u https://ezproxy.insa-cvl.fr/login?qurl=https://dx.doi.org/10.1007/978-3-642-38527-8 |z Accès INSA CVL | |
| 997 | |0 946650 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||