Frontiers in Algorithmics and Algorithmic Aspects in Information and Management Third Joint International Conference, FAW-AAIM 2013, Dalian,China, June 26-28, 2013, Proceedings
This book constitutes the refereed proceedings of the 7th International Frontiers of Algorithmics Workshop, FAW 2013, and the 9th International Conference on Algorithmic Aspects in Information and Management, AAIM 2013, jointly held in Dalian, China, in June 2013. The 33 revised full papers presente...
Saved in:
| Main Authors | , , |
|---|---|
| Format | eBook |
| Language | English |
| Published |
Berlin, Heidelberg
Springer Nature
2013
Springer Berlin / Heidelberg Springer Berlin Heidelberg Springer |
| Edition | 1 |
| Series | Lecture Notes in Computer Science |
| Subjects | |
| Online Access | Get full text |
| ISBN | 364238756X 9783642387562 9783642387555 3642387551 |
| ISSN | 0302-9743 1611-3349 |
| DOI | 10.1007/978-3-642-38756-2 |
Cover
| Abstract | This book constitutes the refereed proceedings of the 7th International Frontiers of Algorithmics Workshop, FAW 2013, and the 9th International Conference on Algorithmic Aspects in Information and Management, AAIM 2013, jointly held in Dalian, China, in June 2013. The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The Joint Conference provide a focused forum on current trends of research on algorithms, discrete structures, operation research, combinatorial optimization and their applications, and will bring together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. The mission of the Joint Conference is to stimulate the various fields for which algorithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western research communities of algorithmics and applications. |
|---|---|
| AbstractList | This book constitutes the refereed proceedings of the 7th International Frontiers of Algorithmics Workshop, FAW 2013, and the 9th International Conference on Algorithmic Aspects in Information and Management, AAIM 2013, jointly held in Dalian, China, in June 2013. The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The Joint Conference provide a focused forum on current trends of research on algorithms, discrete structures, operation research, combinatorial optimization and their applications, and will bring together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. The mission of the Joint Conference is to stimulate the various fields for which algorithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western research communities of algorithmics and applications. |
| Author | Zhu, Binhai Tan, Xuehou Fellows, Michael |
| Author_xml | – sequence: 1 fullname: Fellows, Michael – sequence: 2 fullname: Tan, Xuehou – sequence: 3 fullname: Zhu, Binhai |
| BookMark | eNpN0E1PwyAYB3B8jfPlA3hbvBgPOOAplB7n4nTJzC7GeCO0pV21gwlVv76sNUYu8MDveRL-p-jQOmsQuqTklhKSTrJUYsAiYRhkygVme-gUYtlXr_toRAWlGCDJDv4_HKIRAcJwliZwjEYZCKA8FeQEXYTwRuLKSMLTZIRWc-9s1xgfxo0dT9va-aZbb5oijLUt_1-Mp2Friq53C1s5v9Fd42zPnrTVtdkY252jo0q3wVz87mfoZX7_PHvEy9XDYjZdYs0oSMCSckk0k0zoUvJSVhUrE16kVS53p0RWUOpcACsJN5ICF0KTnJZV1LLQJZyhm2GwDu_mO6xd2wX11ZrcufegYm5_abBoJ4MNW9_Y2ng1KErULuWdVqCiV32D2nVcDx1b7z4-TehUP7iIP_S6Vfd3MyCZyKiM8mqQhQ66bWyjNs662uvtOiieUBaDhx-pz4NA |
| ContentType | eBook |
| Copyright | Springer-Verlag Berlin Heidelberg 2013 |
| Copyright_xml | – notice: Springer-Verlag Berlin Heidelberg 2013 |
| DBID | I4C |
| DEWEY | 005 |
| DOI | 10.1007/978-3-642-38756-2 |
| DatabaseName | Casalini Torrossa eBooks Institutional Catalogue |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 364238756X 9783642387562 |
| EISSN | 1611-3349 |
| Edition | 1 2013 |
| Editor | Zhu, Binhai Tan, Xuehou Fellows, Michael |
| Editor_xml | – sequence: 1 fullname: Fellows, Michael – sequence: 2 fullname: Tan, Xuehou – sequence: 3 fullname: Zhu, Binhai |
| ExternalDocumentID | 9783642387562 315924 EBC3096918 5412157 |
| GroupedDBID | -JY -K2 0D6 0DA 2HV 38. AABBV AARVG AAUBL AAWHR ABBVZ ABFTD ABMLC ABMNI AEDXK AEKFX AETDV AEZAY AFJMS ALMA_UNASSIGNED_HOLDINGS ARZOH AZZ BBABE CZZ I4C IEZ IX0 JJU LDH MA. N2R NUC SAO SBO TPJZQ TSXQS Z7R Z7X Z7Y Z81 Z83 Z88 ACPRQ ADHDZ ADNMO AEJLV AFPTF -DT -GH -~X 1SB 29L 2HA 5QI 875 AASHB ACGFS ADCXD AEFIE EJD F5P FEDTE HVGLF LAS P2P RIG RNI RSU SVGTG VI1 ~02 Z7U |
| ID | FETCH-LOGICAL-a21383-81580a2826ad85d8ff2d45c7fb8f2d448f3dab632d05e813566a0b1dfd858cad3 |
| ISBN | 364238756X 9783642387562 9783642387555 3642387551 |
| ISSN | 0302-9743 |
| IngestDate | Fri Nov 08 04:05:12 EST 2024 Wed Oct 30 01:57:26 EDT 2024 Fri May 30 21:56:40 EDT 2025 Tue Nov 14 22:46:40 EST 2023 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCallNum_Ident | Q |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a21383-81580a2826ad85d8ff2d45c7fb8f2d448f3dab632d05e813566a0b1dfd858cad3 |
| OCLC | 936315760 |
| PQID | EBC3096918 |
| PageCount | 373 |
| ParticipantIDs | askewsholts_vlebooks_9783642387562 springer_books_10_1007_978_3_642_38756_2 proquest_ebookcentral_EBC3096918 casalini_monographs_5412157 |
| PublicationCentury | 2000 |
| PublicationDate | 2013 2013-05-21 |
| PublicationDateYYYYMMDD | 2013-01-01 2013-05-21 |
| PublicationDate_xml | – year: 2013 text: 2013 |
| PublicationDecade | 2010 |
| PublicationPlace | Berlin, Heidelberg |
| PublicationPlace_xml | – name: Netherlands – name: Berlin, Heidelberg |
| PublicationSeriesTitle | Lecture Notes in Computer Science |
| PublicationYear | 2013 |
| Publisher | Springer Nature Springer Berlin / Heidelberg Springer Berlin Heidelberg Springer |
| Publisher_xml | – name: Springer Nature – name: Springer Berlin / Heidelberg – name: Springer Berlin Heidelberg – name: Springer |
| RelatedPersons | Kleinberg, Jon M. Mattern, Friedemann Nierstrasz, Oscar Steffen, Bernhard Kittler, Josef Vardi, Moshe Y. Weikum, Gerhard Sudan, Madhu Naor, Moni Mitchell, John C. Terzopoulos, Demetri Pandu Rangan, C. Kanade, Takeo Hutchison, David Tygar, Doug |
| RelatedPersons_xml | – sequence: 1 givenname: David surname: Hutchison fullname: Hutchison, David organization: Lancaster University, Lancaster, UK – sequence: 2 givenname: Takeo surname: Kanade fullname: Kanade, Takeo organization: Carnegie Mellon University, Pittsburgh, USA – sequence: 3 givenname: Josef surname: Kittler fullname: Kittler, Josef organization: University of Surrey, Guildford, UK – sequence: 4 givenname: Jon M. surname: Kleinberg fullname: Kleinberg, Jon M. organization: Cornell University, Ithaca, USA – sequence: 5 givenname: Friedemann surname: Mattern fullname: Mattern, Friedemann organization: ETH Zurich, Zurich, Switzerland – sequence: 6 givenname: John C. surname: Mitchell fullname: Mitchell, John C. organization: Stanford University, Stanford, USA – sequence: 7 givenname: Moni surname: Naor fullname: Naor, Moni organization: Weizmann Institute of Science, Rehovot, Israel – sequence: 8 givenname: Oscar surname: Nierstrasz fullname: Nierstrasz, Oscar organization: University of Bern, Bern, Switzerland – sequence: 9 givenname: C. surname: Pandu Rangan fullname: Pandu Rangan, C. organization: Indian Institute of Technology, Madras, India – sequence: 10 givenname: Bernhard surname: Steffen fullname: Steffen, Bernhard organization: University of Dortmund, Dortmund, Germany – sequence: 11 givenname: Madhu surname: Sudan fullname: Sudan, Madhu organization: Massachusetts Institute of Technology, USA – sequence: 12 givenname: Demetri surname: Terzopoulos fullname: Terzopoulos, Demetri organization: University of California, Los Angeles, USA – sequence: 13 givenname: Doug surname: Tygar fullname: Tygar, Doug organization: University of California, Berkeley, USA – sequence: 14 givenname: Moshe Y. surname: Vardi fullname: Vardi, Moshe Y. organization: Rice University, Houston, USA – sequence: 15 givenname: Gerhard surname: Weikum fullname: Weikum, Gerhard organization: Max-Planck Institute of Computer Science, Saarbrücken, Germany |
| SSID | ssj0000904574 ssj0002792 |
| Score | 1.8905174 |
| Snippet | This book constitutes the refereed proceedings of the 7th International Frontiers of Algorithmics Workshop, FAW 2013, and the 9th International Conference on... |
| SourceID | askewsholts springer proquest casalini |
| SourceType | Aggregation Database Publisher |
| SubjectTerms | Algorithm Analysis and Problem Complexity Computer algorithms Computer algorithms-Congresses Computer programming, programs, data Computer Science Data Structures Discrete Mathematics in Computer Science Management of Computing and Information Systems Mathematics of Computing Theory of Computation |
| Subtitle | Third Joint International Conference, FAW-AAIM 2013, Dalian,China, June 26-28, 2013, Proceedings |
| TableOfContents | 5.2 Impossibility of Disavowal by the Signatory and the Receiver -- 5.3 Impossibility of Forgery -- 5.4 Other Discussion -- 6 Conclusions -- References -- Randomized Algorithms for Removable Online Knapsack Problems -- 1 Introduction -- 2 Unweighted Knapsack Problem -- 2.1 Upper Bound -- 2.2 Lower Bound -- 3 Weighted Knapsack Problem -- 3.1 Upper Bound -- 3.2 Lower Bound -- References -- An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs -- 1 Introduction -- 2 Notation System -- 3 Reduction Rules -- 4 Properties of Vertex-Cuts with Size at Most 2 -- 5 Branching Rules -- 6 The Algorithm and Results -- 6.1 Framework for Analysis -- 6.2 The Algorithm -- 6.3 The Result -- 7 Framework for the Proof of Lemma 6 -- References -- FWLS: A Local Search for Graph Coloring -- 1 Introduction -- 2 Preliminary -- 3 Focused Walk Based Local Search for Graph Coloring -- 3.1 Basic Notation and Definitions -- 3.2 The FWLS Algorithm -- 4 Experimental Results -- 5 Conclusion and Future Work -- References -- A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids -- 1 Introduction -- 2 A One-Vertex Decomposition Method (1-VDM) -- 3 A One-Vertex Decomposition Algorithm (1-VDA) -- 4 Comparison of 1-VDA with Other Algorithms -- 5 Conclusions and Future Work -- References -- Monomial Testing and Applications -- 1 Introduction -- 2 Notations and Definitions -- 3 A New Transformation -- 3.1 A New Circuit Reconstruction Method -- 3.2 Variable Replacements -- 4 A Faster Randomized Algorithm -- 5 A Deterministic Algorithm via Derandomization -- 6 Applications -- 6.1 Allowing Overlapping in -- 6.2 Testing Non-Simple -- 6.3 A Generalized -- References -- The Optimal Rescue Path Set Problem in Undirected Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Properties of Optimal Rescue Path Set -- 3.1 Minimum Joint Replacement Path Set Kernelization and Lower Bounds of the Signed Domination Problem -- 1 Introduction -- 2 Preliminaries -- 3 The Complexity of -- 4 Kernelizations of -- 4.1 Kernel for General Graphs -- 4.2 Kernel for Planar Graphs -- 4.3 Kernel for d-Partite Graphs -- 4.4 Kernel for Bounded-Degree Graphs -- 4.5 Kernel for r-Regular Graphs -- 4.6 Kernel for Grid Graphs -- 5 Conclusion -- References -- On Edge-Independent Sets -- 1 Introduction -- 2 Rankwidth of Edge-Clique Graphs of Cocktail Parties -- 3 Algorithms for Distance-Hereditary Graphs and Related Graph Classes -- 3.1 Cographs -- 3.2 Distance-Hereditary Graphs -- 3.3 P4-Sparse Graphs -- 4 Algorithms for Planar Graphs -- 4.1 Planar Graphs without Triangle Separator -- 5 NP-Completeness for Graphs without Odd Wheels -- 6 Concluding Remarks -- References -- On the Complexity of Approximate Sum of Sorted List -- 1 Introduction -- 2 Algorithm for Approximate Sum of Sorted List -- 2.1 Approximate Region -- 2.2 Approximate Sum -- 3 Lower Bounds -- 3.1 Lower Bound for Computing Approximate Sum -- 3.2 Lower Bound for Computing Approximate Region -- 3.3 Lower Bound for Sorted List with Negative Elements -- 4 Conclusions and Open Problems -- References -- Large Hypertree Width for Sparse Random Hypergraphs -- 1 Introduction -- 2 Preliminaries -- 3 Lower Bound on Hypertree Width for Random Hypergraphs -- 4 Conclusion and Open Problems -- References -- On Perfect Absorbants in De Bruijn Digraphs -- 1 Introduction -- 2 Preliminaries -- 3 Perfect Absorbants of GB(n,d) -- 4 GB(n,d) with d = 2c(k−1)+1 -- 5 Concluding Remarks -- References -- Multi-Multiway Cut Problem on Graphs of Bounded Branch Width -- 1 Introduction -- 2 Preliminaries -- 2.1 Graph -- 2.2 Branch Decomposition -- 2.3 Logic -- 3 Logical Approach -- 4 Dynamic Programming Approach -- 4.1 Computing -- 4.2 Proof of the Correctness -- 5 Conclusion -- References 4 Optimal Rescue Path Set -- 5 Conclusion -- References -- Expected Computations on Color Spanning Sets -- 1 Introduction -- 2 Problem Definition -- 3 Algorithm for Problem 1 -- 4 Algorithm for Problem 2 -- 5 Algorithm for Problem 3 -- 6 Algorithm for Problem 4 -- 7 Algorithm for Problem 5 -- 8 Conclusions -- References -- Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Reduction from Circular-Convex Bipartite Graphs -- 4 Reduction from Triad-Convex Bipartite Graphs -- 5 Concluding Remarks -- References -- Spanning Distribution Trees of Graphs -- 1 Introduction -- 2 NP-Completeness -- 3 Pseudo-polynomial Algorithm -- 3.1 Outline of Algorithm -- 3.2 Definitions of Functions -- 3.3 Algorithm -- 3.4 Computation Time -- 4 Concluding Remarks -- References -- A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem -- 1 Introduction -- 2 Problem Formulation -- 3 Results on TDCPP Polyhedron -- 3.1 Affinely Independent TDCPP-Tours in CA Polytope -- 3.2 Dimension of CA Polytope -- 3.3 Facet Defining Inequalities for the CA Polytope -- 3.4 Further Strong Valid Inequalities for TDCPP -- 4 Description of the Cutting Plane Heuristic Algorithm -- 5 Computational Results -- 6 Conclusion -- References -- Zero-Visibility Cops and Robber Game on a Graph -- 1 Introduction -- 2 Zero-Visibility Cops and Robber -- 3 Pathwidth and the Zero-Visibility Copnumber -- 4 Constructions -- 5 Comparisons between the Zero-Visibility Copnumbers and the Pathwidth of a Graph -- 6 Conclusion -- References -- On (k, l)-Graph Sandwich Problems -- 1 Introduction -- 2 The Strongly Chordal-(2, 1) Graph Sandwich Problem -- 2.1 The Strongly Chordal-(k, l) Graph Sandwich Problem, k ≥ 2, l ≥ 1 -- 3 Graph Sandwich Problems with Boundary Conditions 3.1 (Poly-Color(k), (k, l), Polynomial Number of Maximal Cliques)- sp -- 4 Conclusion -- References -- Fixed-Parameter Tractability ofWorkflow Satisfiability in the Presence of Seniority Constraints -- 1 Introduction -- 2 Preliminaries -- 3 FPT Algorithm for Bounded Treewidth -- 4 Hardness -- 5 Concluding Remarks -- References -- Two-Round Discrete Voronoi Game along a Line -- 1 Introduction -- 2 Lower Bounds -- 3 Optimal Strategies of P1 and P2 While Placing Second Facilities -- 4 Optimal Strategy of P2 While Placing the First Facility -- 5 Optimal Strategy of P1 While Placing the First Facility -- References -- Inverse Maximum Flow Problems under the Combining Norms -- 1 Introduction -- 2 Inverse Maximum Flow Problem under the Sum-Type Combining Norms -- 3 Inverse Maximum Flow Problem under the Bottleneck-Type Combining Norms -- 4 Concluding Remarks -- References -- The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs -- 1 Introduction, Notation and Terminology -- 2 Construction of Monochromatic Structures in -- 3 Construction of PEC Paths, Trails and Cycles -- 3.1 The Non-Oriented Case -- 3.2 The Oriented Case -- 4 Destruction of pec Cycles and pec Closed Trails in Gc -- References -- A Cost-Efficient Scheduling Algorithm for Traffic Grooming -- 1 Introduction -- 2 Problem Formulation -- 3 The Approximation Algorithm: Longest Link Interval First -- 4 Conclusion -- References -- Strategies of Groups Evacuation from a Convex Region in the Plane -- 1 Introduction -- 2 Preliminary -- 3 Lower Bound -- 4 Scenario 1: General Plane -- 5 Scenario 2: Plane with Grid Network -- 5.1 Analysis of Strategy with Boundary Information -- 5.2 Analysis of Strategies without Boundary Information -- 6 Comparison -- 6.1 Comparison of Different Scenarios -- 6.2 Comparison of Different Cases -- 7 Conclusion -- References Intro -- Preface -- Organization -- Table of Contents -- Invited Lectures -- The Square Root Phenomenon in Planar Graphs -- An Algorithm for Determining Whether a Pair of Polygons Is Reversible -- References -- Contributed Papers -- Disjoint Small Cycles in Graphs and Bipartite Graphs -- 1 Introduction -- 2 Lemmas -- 3 Proof of Theorem 1.3 -- 4 Bipartite Graph -- 5 Conjectures -- References -- An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree -- 1 Introduction -- 2 Results -- References -- Algorithms for Testing Length Four Permutations -- 1 Introduction -- 2 Preliminaries -- 3 Length Four Permutations Except 1324 -- 4 Permutation 1324 -- 5 Concluding Remarks -- References -- Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contribution -- 2 Approximation Algorithms for the Unweighted Case -- 2.1 Edge Addition Based Algorithm -- 2.2 Edge Deletion Based Algorithm -- 2.3 LP Based Algorithm -- 2.4 Algorithm for IP2 -- 3 Approximation Algorithm for the Weighted Case -- 3.1 The Algorithm -- 4 Exact Algorithm for Trees -- References -- Faster Exact Computation of rSPR Distance -- 1 Introduction -- 2 Preliminaries -- 3 Sketch of Whidden et al.'s Algorithm for rSPR Distance -- 4 Ideas for Improving Whidden et al.'s Algorithm -- 5 Details of Step 5 in Section 4 When -- Is a Leaf -- 6 The Worst Case in Our Algorithm -- 7 Performance Comparison -- References -- Arbitrated Quantum Signature Schemes: Attacks and Security -- 1 Introduction -- 2 Quantum One-Time Pads Encryption -- 3 Attacks on Arbitrated Quantum Signature -- 3.1 Bob's Forgery Attacks -- 3.2 Alice's Disavowal Attacks -- 3.3 The Reasons for AQS Scheme Suffered Attacks -- 3.4 Other Attacks -- 4 An AQS Scheme -- 5 Security Analyses -- 5.1 The Method to Resolve Disputes Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints |
| Title | Frontiers in Algorithmics and Algorithmic Aspects in Information and Management |
| URI | http://digital.casalini.it/9783642387562 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=3096918 http://link.springer.com/10.1007/978-3-642-38756-2 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783642387562 |
| Volume | 7924 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NT9swFH-CclkvfGzTSgFFiMMumZI4TtzjQEVVheBSqt4sJ3E2NFYmUnbYX7-fXSdNGJoEFyu1XvKq93Ne3rPfB9FZIkqBD00C38QMWuGdG0WhDzUYZbkKRtE62uI6mdzG0wVfbBqT2OySVfYl__NiXslbUMUccDVZsq9AtnkoJnANfDECYYzPjN_mp-s5ZMoOmCbWdrvi_tsDXPzvP-uCy60JiP-Xjde4M5t_TaaiC6_oRL4419-0Yei4_vXWn4lrduVHGs-Qwa9g8EXWqu4fPdkOjQClb0ldHmK3_DSPTf2JdJu20xTO7c7X8fRq3uxiBSOYhKnpndUwdGWNNn-gPkt25Xw7DPvUV9UPqHOo-lVlbANVKZMS2jH4n51R20__bI92tMkH2actvTyg3boLhueU4nu6acDw7pZeGwwPUm5PeA4MQ9cCw5JtwPhA88vx7GLiuzYVvopCOPi-CLkIFHzXRBWCF6IsoyLmeVpmwlzFomSFyhIWFQHXImSwoFWQhUUJapGrgn2k3vJhqT-Rl-ah5iaMrSx0nMF4hZGRqkDjNp6ykg_otCUv-fveHqlXsiPwAQ1rMUqs-HXp80o6JAfk1ZKV9m4XBSzH5xcML-woFAP6XEtcrp9fF7cGH8kkOEnLSkaH_-U1pHebdXtEvdXjkz6GEbfKTtxK-gsm3kAz |
| linkProvider | Library Specific Holdings |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Frontiers+in+Algorithmics+and+Algorithmic+Aspects+in+Information+and+Management&rft.date=2013-01-01&rft.pub=Springer+Nature&rft.isbn=9783642387562&rft_id=info:doi/10.1007%2F978-3-642-38756-2&rft.externalDocID=5412157 |
| thumbnail_m | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97836423%2F9783642387562.jpg |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fmedia.springernature.com%2Fw306%2Fspringer-static%2Fcover-hires%2Fbook%2F978-3-642-38756-2 |