Algorithms and data structures : 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007 : proceedings
The papers in this volume were presented at the 10th Workshop on Algorithms and Data Structures (WADS 2005). The workshop took place August 15 - 17, 2007, at Dalhousie University, Halifax, Canada. The workshop alternates with the Scandinavian Workshop on Algorithm Theory (SWAT), continuing the t- di...
Saved in:
| Main Authors | , , , |
|---|---|
| Format | eBook Book |
| Language | English |
| Published |
Berlin
Springer
2007
Springer Berlin / Heidelberg |
| Edition | 1 |
| Series | Lecture Notes in Computer Science |
| Subjects | |
| Online Access | Get full text |
| ISBN | 9783540739487 3540739483 |
Cover
| Abstract | The papers in this volume were presented at the 10th Workshop on Algorithms and Data Structures (WADS 2005). The workshop took place August 15 - 17, 2007, at Dalhousie University, Halifax, Canada. The workshop alternates with the Scandinavian Workshop on Algorithm Theory (SWAT), continuing the t- dition of SWAT and WADS starting with SWAT 1988 and WADS 1989. From 142 submissions, the Program Committee selected 54 papers for presentation at the workshop. In addition, invited lectures were given by the following dist- guished researchers: Je? Erickson (University of Illinois at Urbana-Champaign) and Mike Langston (University of Tennessee). On behalf of the Program Committee, we would like to express our sincere appreciation to the many persons whose e?ort contributed to making WADS 2007 a success. These include the invited speakers, members of the Steering and ProgramCommittees, the authorswho submitted papers, andthe manyreferees who assisted the Program Committee. We are indebted to Gerardo Reynaga for installing and modifying the submission software, maintaining the submission server and interacting with authors as well as for helping with the preparation of the program. |
|---|---|
| AbstractList | The papers in this volume were presented at the 10th Workshop on Algorithms and Data Structures (WADS 2005). The workshop took place August 15 - 17, 2007, at Dalhousie University, Halifax, Canada. The workshop alternates with the Scandinavian Workshop on Algorithm Theory (SWAT), continuing the t- dition of SWAT and WADS starting with SWAT 1988 and WADS 1989. From 142 submissions, the Program Committee selected 54 papers for presentation at the workshop. In addition, invited lectures were given by the following dist- guished researchers: Je? Erickson (University of Illinois at Urbana-Champaign) and Mike Langston (University of Tennessee). On behalf of the Program Committee, we would like to express our sincere appreciation to the many persons whose e?ort contributed to making WADS 2007 a success. These include the invited speakers, members of the Steering and ProgramCommittees, the authorswho submitted papers, andthe manyreferees who assisted the Program Committee. We are indebted to Gerardo Reynaga for installing and modifying the submission software, maintaining the submission server and interacting with authors as well as for helping with the preparation of the program. |
| Author | Workshop on Algorithms and Data Structures Dehne, Frank Zeh, Norbert Sack, Jörg-Rüdiger |
| Author_xml | – sequence: 1 fullname: Workshop on Algorithms and Data Structures – sequence: 2 fullname: Dehne, Frank – sequence: 3 fullname: Sack, Jörg-Rüdiger – sequence: 4 fullname: Zeh, Norbert |
| BackLink | https://cir.nii.ac.jp/crid/1130282273158243200$$DView record in CiNii |
| BookMark | eNqNkE1PwzAMhoP4EGzsP-SAhJA2KYmbJuE2yoBJSBxAcKy8NtvKSjqaFBC_noxxgBs-2LL8yPb79siea5zdIQOjNMiEKTCSq93ffaLVPukJxpQBngp5QI64ToxImUkPycD7ZxYjjrgWR-RzXC-atgrLF0_RlbTEgNSHtitC11pPzylnYUmnLtjWYagahzV9atqVXzbrIX0aX97Tza0hvcG6muPHkGbosMQhHXeLzgfK5YjH8QaK29ZtU1hbVm7hj8n-HGtvBz-1Tx6vJg_Zzej27nqajW9HmAhIxAisMUZrKIXEmZhphqqwSVpoBAlzZGjs3HBrkGk-A66VlCijRLtRGG2BPjnbLka_su_x8Tr4_K22s6ZZ-fyPk5E93bLx0dfO-pB_Y4V1ocU6n1xkqeKcp_ofJLAUQMpInmxJV1V5UW0y58CEFkIBl1okEN2BL_EhhII |
| ContentType | eBook Book |
| DBID | RYH |
| DEWEY | 005.73 |
| DatabaseName | CiNii Complete |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9783540739517 3540739513 |
| Edition | 1 2007 edition. |
| ExternalDocumentID | 9783540739517 EBC6711168 EBC3063355 BA82897285 |
| GroupedDBID | 089 0D6 0DA 2HV 38. A4J AABBV AAHDE AAJYQ AATVQ AAUKK ABBUY ABBVZ ABCYT ABMNI ACDTA ACDUY ACFGI ADQVG AEDXK AEHEY AEHWL AEJLV AEKFX AETDV AEZAY AGNDD AHMWK AHNNE ALMA_UNASSIGNED_HOLDINGS ATJMZ AZZ BBABE CZZ E6I IEZ IV0 JJU LZA MA. MW~ NUP RYH SBO TPJZQ TSXQS UR3 Z83 Z84 Z88 -7M -7P -BG AAFYB LDH NUC SAO Z7R Z7X Z8R Z8W Z92 |
| ID | FETCH-LOGICAL-a42342-3e999883d25ab2b80a7ce46c8a353fa0a9ef91e9a081b318755a5000e61827833 |
| ISBN | 9783540739487 3540739483 |
| IngestDate | Fri Nov 08 04:04:45 EST 2024 Thu Oct 09 04:42:17 EDT 2025 Tue Sep 09 06:54:28 EDT 2025 Thu Jun 26 21:41:24 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCN | 2007931625 |
| LCCallNum_Ident | QA76.9.D35 -- W333 2007eb |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a42342-3e999883d25ab2b80a7ce46c8a353fa0a9ef91e9a081b318755a5000e61827833 |
| Notes | Includes bibliographical references and index |
| OCLC | 184926096 |
| PQID | EBC3063355 |
| PageCount | 675 |
| ParticipantIDs | askewsholts_vlebooks_9783540739517 proquest_ebookcentral_EBC6711168 proquest_ebookcentral_EBC3063355 nii_cinii_1130282273158243200 |
| PublicationCentury | 2000 |
| PublicationDate | c2007 2007 2007-08-21 |
| PublicationDateYYYYMMDD | 2007-01-01 2007-08-21 |
| PublicationDate_xml | – year: 2007 text: 2007 |
| PublicationDecade | 2000 |
| PublicationPlace | Berlin |
| PublicationPlace_xml | – name: Berlin – name: Berlin/Heidelberg – name: Berlin, Heidelberg |
| PublicationSeriesTitle | Lecture Notes in Computer Science |
| PublicationYear | 2007 |
| Publisher | Springer Springer Berlin / Heidelberg |
| Publisher_xml | – name: Springer – name: Springer Berlin / Heidelberg |
| SSID | ssj0000316182 |
| Score | 1.8253688 |
| Snippet | The papers in this volume were presented at the 10th Workshop on Algorithms and Data Structures (WADS 2005). The workshop took place August 15 - 17, 2007, at... |
| SourceID | askewsholts proquest nii |
| SourceType | Aggregation Database Publisher |
| SubjectTerms | Computer algorithms Computer algorithms -- Congresses Congresses Data structures (Computer science) Data structures (Computer science) -- Congresses |
| TableOfContents | The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces -- On the Robustness of Graham's Algorithm for Online Scheduling -- Improved Results for a Memory Allocation Problem -- Computational and Structural Advantages of Circular Boundary Representation -- Alpha-Beta Witness Complexes -- Cauchy's Theorem and Edge Lengths of Convex Polyhedra -- Fixed-Parameter Tractability for Non- Crossing Spanning Trees -- Improved Algorithms for the Feedback Vertex Set Problems -- Kernelization Algorithms for d-Hitting Set Problems -- Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points -- Maximizing Maximal Angles for Plane Straight-Line Graphs -- Cuttings for Disks and Axis-Aligned Rectangles -- Kernelization and Complexity Results for Connectivity Augmentation Problems -- An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem -- Branch and Recharge: Exact Algorithms for Generalized Domination -- On Computing the Centroid of the Vertices of an Arrangement and Related Problems -- Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p -- Faster Approximation of Distances in Graphs -- Approximate Shortest Paths Guided by a Small Index -- Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model -- Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field -- 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality -- On Euclidean Vehicle Routing with Allocation -- Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets -- Range Non-overlapping Indexing and Successive List Indexing -- Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters -- Dynamic TCP Acknowledgment with Sliding Window -- Author Index Intro -- Preface -- WADS Organization -- Table of Contents -- Finding Small Holes -- Approximate Range Searching: The Absolute Model -- Orthogonal Range Searching in Linear and Almost-Linear Space -- Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere -- A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity -- Approximating the Maximum Sharing Problem -- The Stackelberg Minimum Spanning Tree Game -- Edges and Switches, Tunnels and Bridges -- How to Draw a Clustered Tree -- Drawing Colored Graphs on Colored Points -- Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric -- Priority Queues Resilient to Memory Faults -- Simple and Space-Efficient Minimal Perfect Hash Functions -- A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane -- A Pseudopolynomial Time O(log n)-Approximation Algorithm for Art Gallery Problems -- Optimization for First Order Delaunay Triangulations -- Constant Factor Approximations for the Hotlink Assignment Problem -- Approximation Algorithms for the Sex-Equal Stable Marriage Problem -- A Stab at Approximating Minimum Subadditive Join -- Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two Datasets -- Flooding Countries and Destroying Dams -- I/O-Efficient Flow Modeling on Fat Terrains -- Computing the Visibility Map of Fat Objects -- Independent Sets in Bounded-Degree Hypergraphs -- Steiner Tree in Planar Graphs: An O(n log n) Approximation Scheme with Singly-Exponential Dependence on Epsilon -- Computing a Minimum-Depth Planar Graph Embedding in O(n4) Time -- On a Family of Strong Geometric Spanners That Admit Local Routing Strategies -- Spanners for Geometric Intersection Graphs -- On Generalized Diamond Spanners Conclusions Edges and Switches, Tunnels and Bridges -- Introduction -- Minimizing Switches -- Minimizing Tunnels -- Stacking Model -- Weaving Model -- Conclusions and Open Problems -- References -- How to Draw a Clustered Tree -- Introduction and Overview -- Preliminaries -- R-Drawings of C-Connected C-Trees -- R-Drawings and C-Drawings of Non-C-Connected C-Trees -- NC-Drawings of C-Trees -- References -- Drawing Colored Graphs on Colored Points -- Introduction and Overview -- Preliminaries -- Lower Bound on the Curve Complexity -- Upper Bound on the Curve Complexity -- References -- Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric -- Introduction -- Discrepancy-Sensitive Dynamic Fractional Cascading -- Dynamic Dominated Maxima -- Dynamic Nearest Neighbors in Minkowski Metrics -- Experimental Results -- References -- Priority Queues Resilient to Memory Faults -- Introduction -- Preliminaries -- Fault Tolerant Priority Queue -- Structure -- Push and Pull Primitives -- Insert and Deletemin -- Analysis -- Correctness -- Complexity -- Lower Bound -- References -- Simple and Space-Efficient Minimal Perfect Hash Functions -- Introduction -- Related Work -- Theoretical Results -- Practical Results -- Heuristics -- A Family of Minimal Perfect Hashing Methods -- Mapping Step -- Assigning Step -- Ranking Step -- The 2-Uniform Hypergraph Instance -- Improving the Space -- The 3-Uniform Hypergraph Instance -- Improving the Space -- The Full Randomness Assumption -- Experimental Results -- Conclusions -- References -- A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane -- Introduction -- Related Work -- On Spanners and Banyans -- Our Contribution and Outline -- The Algorithm -- Correctness -- Key Differences -- First Proof -- Uniform Orientation Metrics Adapting the Proofs -- Planar Spanners -- References -- A Pseudopolynomial Time O(\log{n})-Approximation Algorithm for ArtGallery Problems -- Introduction -- Basic Terminology -- Initial Triangulation Using Visibility Cell Decomposition -- Further Subdivision of the Initial Triangulation -- Vertex-Visibility Property and Vertex-Pair-Visibility Property -- Further Subdivision -- Set Cover Formulation and Approximate Solution -- Analysis of the Algorithm -- Bound on the Approximation Ratio of Our Algorithm -- Analysis of the Running Time of the Algorithm -- Art Gallery with Holes -- Conclusions -- References -- Optimization for First Order Delaunay Triangulations -- Introduction -- Exact Algorithms -- Measures on Edge-Adjacent Triangles -- Measures on Vertex-Adjacent Triangles -- NP-Hardness Results -- Mixed Vertices -- Maximum Vertex Degree and Convex Edges -- Approximation Algorithms -- Maximizing the Number of Convex Edges -- Maximizing the Number of Non-mixed Vertices -- Maximizing the Number of Convex Edges, k-th Order -- Discussion -- References -- Constant Factor Approximations for the Hotlink Assignment Problem -- Introduction -- Further Notation and Basic Operations -- The Natural Greedy Strategy -- An Approximation Scheme for the Gain -- A 2-Approximation in Terms of the Path Length -- Generalization to Multiple Hotlink Assignment -- Final Remarks -- References -- Approximation Algorithms for the Sex-Equal Stable Marriage Problem -- Introduction -- Rotation Poset -- The Sex-Equal Stable Marriage Problem -- The Minimum Egalitarian Sex-Equal Stable Marriage Problem -- NP-Hardness of MinESE -- Approximation Algorithms for MinESE -- Concluding Remarks -- References -- A Stab at Approximating Minimum Subadditive Join -- Introduction -- A Polynomial Time Approximation Algorithm -- Minimum Coverage -- Hardness Approximation of Minimum Loss k-Ambiguity -- Discussion -- References -- Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two Datasets -- Flooding Countries and Destroying Dams -- Introduction -- Removing Local Minima by Lifting -- Removing Local Minima by Lowering -- Removing All Local Minima -- Approximation Algorithm -- Other Measures -- Conclusions and Future Work -- References -- I/O-Efficient Flow Modeling on Fat Terrains -- Introduction -- Preliminaries -- Modeling Flow with a Descent Graph -- Computing the Rivers and the Watershed Area Map -- A Data Structure for Flow Path and Watershed Queries -- References -- Computing the Visibility Map of Fat Objects -- Introduction -- Preliminaries -- The Algorithm -- The Data Structure -- Tracing an Arc -- Details of the Algorithm -- References -- Independent Sets in Bounded-Degree Hypergraphs -- Introduction -- Definitions -- Shrinkage Reduction -- Local Search -- Partitioning -- Greedy -- The GreedyMAX Algorithm -- The GreedyMIN Algorithm -- References -- Steiner Tree in Planar Graphs: An O(\log{n}) Approximation Scheme with Singly-Exponential Dependence on Epsilon -- Introduction -- Notation -- Algorithm -- Mortar Graph -- Bricks -- Portals -- Portal-Connected Graph and the Operation {{\cal B}^+} -- Parcels -- New Terminals -- Optimal Solution Within the Parcels -- Proof of the Structure Theorem (Theorem 3) -- Structural Property of Bricks -- Completion of the Proof of Theorem 3 -- References -- Computing a Minimum-Depth Planar Graph Embedding in O(n^4) Time -- Introduction -- Background -- The Combinatorial Structure of Planar Embeddings and Their Depths -- Computing a Minimum-Depth Embedding of a Biconnected Planar Graph -- Labeling an SPQR-Tree with Minimum-Depth Embedding Descriptors -- Computing the Minimum Depth and the Minimum-Depth Embedding Intro -- Title Page -- Preface -- Organization -- Table of Contents -- Finding Small Holes -- Approximate Range Searching: The Absolute Model -- Introduction -- Preliminaries -- Halfspace Range Searching -- Approximate Semigroup Version -- Approximate Idempotent Version -- Exact Idempotent Version -- Halfbox Quadtree -- Approximate Spherical Range Searching -- Approximate Simplex Range Searching -- Other Results -- References -- Orthogonal Range Searching in Linear and Almost-Linear Space -- Introduction -- Range Reporting on the Narrow Grid -- Range Counting Queries on the Narrow Grid -- Two-Dimensional Range Searching -- Two-Dimensional Semi-group Range Counting -- References -- Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere -- Introduction -- Locality Sensitive Hashing (LSH) -- Spherical LSH (SLSH) -- Problem Description -- Locality Sensitive Hash Functions Using a Regular Polytope -- The Algorithm -- Performance Evaluation -- Discussion -- Conclusion -- References -- A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity -- Introduction -- Definitions -- Locally Connected Cycles and a New Lower Bound -- Examples -- Overview of the Algorithm -- Virtual Edges -- Algorithm 3EdgeConnect(G) -- Selecting a Target Component -- 2-Connecting a Cycle -- 2-Connecting a Path -- Summary -- References -- Approximating the Maximum Sharing Problem -- Introduction -- Approximating MS: A Special Case -- The Color Path-Cycle Packing Problem (CPCP) -- Solving CPCP -- A 1.5-Approximation for CPP and MS -- A More Practical 1.5-Approximation Algorithm -- Approximating MS: The General Case -- References -- The Stackelberg Minimum Spanning Tree Game -- Introduction -- Basic Results -- Complexity and Inapproximability -- The Best-Out-Of-k Algorithm -- Linear Programming Relaxation -- References Extension to General Planar Graphs -- Conclusions -- References -- On a Family of Strong Geometric Spanners That Admit Local Routing Strategies -- Introduction -- The Family G_\lambda^\theta of Graphs -- Location of Destroyers -- The Spanning Ratio of G_\lambda^\theta -- Half-Space Proximal -- Unit Disk Graph Spanners -- Simulation Results -- Conclusion -- References -- Spanners for Geometric Intersection Graphs -- Introduction -- Preliminaries -- Our Contributions -- Modified Yao Graph -- Partitioning the Plane -- Spanners of Disk Graphs -- Algorithmic Version -- Extension to Ball Graphs -- Speeding up on Unit Ball Graphs -- Separators in Spanner Graph -- Approximate Proximity Problems Using Spanner -- References -- On Generalized Diamond Spanners -- Introduction -- Constructing Spanner Paths -- One-Sided Paths -- Two-Sided Paths -- The Final Spanning Ratio -- Triangulations That Have the Diamond Property -- References -- The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces -- Introduction -- Lower Bounds -- Uniform Metric Spaces -- Phase-Based Algorithms for the DR Problem -- Randomized Phase-Based Algorithm for DR Problem -- Uniformly Decomposable Metric Spaces -- References -- On the Robustness of Graham's Algorithm for Online Scheduling -- Introduction -- Arbitrary Perturbations -- Arbitrary Decreases in Processing Time -- Arbitrary Increases in Processing Time -- Bounded Perturbations -- Bounded Decreases in Processing Times -- Bounded Increases in Processing Times -- References -- Improved Results for a Memory Allocation Problem -- Introduction -- NP-Hardness of the Problem (in the strong sense) -- The NEXT FIT Algorithm -- The Structure of the Optimal Packing for k = 2 -- A 7/5-Approximation for k = 2 -- Algorithm Halts in Step 5 -- Critical Items -- Algorithm Halts in Step 3 -- Algorithm Halts in Step 6 |
| Title | Algorithms and data structures : 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007 : proceedings |
| URI | https://cir.nii.ac.jp/crid/1130282273158243200 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=3063355 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=6711168 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783540739517 |
| Volume | 4619 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3fb9MwELZYERJ74bfoxpCFeFuCkji2E97artNUAQ9sjImXyE7dpmJrpSXdw_567hwnWcsEghcrjVzHvS_1fXe-8xHyPo1MwPMYVz9u_DgxytdToX3FIi2k5IbnmI38-Ys4-RZPLvhFU2DcZZdU-kN-e29eyf-gCvcAV8yS_Qdk20HhBlwDvtACwtBukd_2owstvpyvwKovruoTljHM87A-CXZ9jX5UNPODqtjy96FjvCxWtiLd98HRKR4nKK3uwQQtVRccxiCw2te6nq_L6jDkfmg7YWc7cqfzWj7ejIxbD1tzO8K5nbZza4mzKVxkMVaNb_08ql6dJ7h_PxTXc_-rvRrhYbJtGPEPU7gtJ4wK3_BbyC2_ReO33LBn0QklWRo7Hbx5EPZwgNahjBK-Q3akBEv74WA8-XTeutRgfRJgLrkMHjsOe9Q6t-pxd8muKn-C_gDdUpVAKJaLxW9q2HKLs6ekh_kmz8gDs3xOnjRVNqhbdF-Q206gFARKEWzagU0_UoSabkBNG0A8ikBTlIxHHcwerUH2aA0xtRB7thOMdgfel-T8eHw2OvFdxQxfAS2OI58ZIPxJwqYRVzrSSaBkbmKRJ4pxNlOBSs0sDU2qgAlqWM4l57YkhkHBgZzYK9JbrpbmNaFazOJYKp5LMDk1Ewkz8NcNZwrIzlTnQZ-8uyPJ7ObS7u6XWSduHso-OQABZ_kC2xA3yYGQShbyJIoZ_Kw-oY3oM_t9F5KcjYcjMGYZsOE_dRESVLVI9v7ylH3yuHsD35AeQGQOgEtW-q17h34B-dlodw |
| 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=Algorithms+and+data+structures+%3A+10th+International+Workshop%2C+WADS+2007%2C+Halifax%2C+Canada%2C+August+15-17%2C+2007+%3A+proceedings&rft.au=Workshop+on+Algorithms+and+Data+Structures&rft.au=Dehne%2C+Frank&rft.au=Sack%2C+J%C3%B6rg-R%C3%BCdiger&rft.au=Zeh%2C+Norbert&rft.date=2007-01-01&rft.pub=Springer&rft.isbn=9783540739487&rft.externalDocID=BA82897285 |
| thumbnail_m | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97835407%2F9783540739517.jpg |