Frontiers in Algorithmics 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings
This book constitutes the proceedings of the 9th International Workshop on Frontiers in Algorithmics, FAW 2015, held in Guilin, China, in July 2015. The 28 papers presented in this volume were carefully reviewed and selected from 65 submissions. They deal with graph algorithms, approximation algorit...
Saved in:
| Main Authors | , |
|---|---|
| Format | eBook |
| Language | English |
| Published |
Cham
Springer Nature
2015
Springer International Publishing AG Springer International Publishing |
| Edition | 1 |
| Series | Lecture Notes in Computer Science |
| Subjects | |
| Online Access | Get full text |
| ISBN | 9783319196473 3319196472 9783319196466 3319196464 |
Cover
| Abstract | This book constitutes the proceedings of the 9th International Workshop on Frontiers in Algorithmics, FAW 2015, held in Guilin, China, in July 2015. The 28 papers presented in this volume were carefully reviewed and selected from 65 submissions. They deal with graph algorithms, approximation algorithms, combinatorial optimization, parameterized algorithms, and online algorithms. |
|---|---|
| AbstractList | This book constitutes the proceedings of the 9th International Workshop on Frontiers in Algorithmics, FAW 2015, held in Guilin, China, in July 2015. The 28 papers presented in this volume were carefully reviewed and selected from 65 submissions. They deal with graph algorithms, approximation algorithms, combinatorial optimization, parameterized algorithms, and online algorithms. |
| Author | Wang, Jianxin Yap, Chee |
| Author_xml | – sequence: 1 fullname: Wang, Jianxin – sequence: 2 fullname: Yap, Chee |
| BookMark | eNqN0M1LwzAYBvCIHzhn_wBvw4t4KOS7yXGWTYWBF_Ea0jRZ67JkJlX_fYv1oidPLw_8eOB5L8BJiMEegUJWghAkkeS0Isd_8hmYSYQZhgLTc1Dk_AohRIwJhtEMXK1TDENvU170YbH025j6odv3Jl-CU6d9tsXPnYOX9eq5fig3T_eP9XJTajIWwRIZ17rKOkIbqJEThjWMtS2shDUMC1dRTLGwnHCJBeWttBy3VDecc6dFQ8gc3E7FOu_sZ-6iH7L68LaJcZfVry2jvZnsIcW3d5sH9c2MDUPSXq3uao6lJPA_cnyBwFCO8nqSRmft-9CrfQxxm_Shy4pRhBHj5AuaXGZS |
| ContentType | eBook |
| DBID | I4C |
| DEWEY | 005.1 |
| DatabaseName | Casalini Torrossa eBooks Institutional Catalogue |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9783319196473 3319196472 |
| Edition | 1 2015 |
| Editor | Wang, Jianxin Yap, Chee |
| Editor_xml | – sequence: 1 fullname: Wang, Jianxin – sequence: 2 fullname: Yap, Chee |
| ExternalDocumentID | 9783319196473 EBC6299303 EBC5588209 5412156 |
| GroupedDBID | 0D6 0DA 38. AABBV AAGZE AAZAK AAZUS ABBVZ ABFTD ABMNI ACKNT ACRRC AEDXK AEKFX AETDV AEZAY ALMA_UNASSIGNED_HOLDINGS APFYR AZZ BBABE CZZ I4C IEZ IY- LDH NUC SAO SBO SFQCF TMQGW TPJZQ TSXQS TWXRB Z7R Z7X Z7Y Z81 Z83 Z88 AEJLV Z7U |
| ID | FETCH-LOGICAL-a30000-1cfdf7ef34b0a1f8c5b55dd078ec528f742428e63692846d9e62d4ab666fa8b33 |
| ISBN | 9783319196473 3319196472 9783319196466 3319196464 |
| IngestDate | Fri Nov 08 04:07:51 EST 2024 Fri May 30 22:57:36 EDT 2025 Fri May 30 23:27:21 EDT 2025 Tue Nov 14 22:46:39 EST 2023 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCallNum_Ident | Q |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a30000-1cfdf7ef34b0a1f8c5b55dd078ec528f742428e63692846d9e62d4ab666fa8b33 |
| OCLC | 912520824 |
| PQID | EBC5588209 |
| PageCount | 343 |
| ParticipantIDs | askewsholts_vlebooks_9783319196473 proquest_ebookcentral_EBC6299303 proquest_ebookcentral_EBC5588209 casalini_monographs_5412156 |
| PublicationCentury | 2000 |
| PublicationDate | 2015 2015-06-26 |
| PublicationDateYYYYMMDD | 2015-01-01 2015-06-26 |
| PublicationDate_xml | – year: 2015 text: 2015 |
| PublicationDecade | 2010 |
| PublicationPlace | Cham |
| PublicationPlace_xml | – name: Netherlands – name: Cham |
| PublicationSeriesTitle | Lecture Notes in Computer Science |
| PublicationYear | 2015 |
| Publisher | Springer Nature Springer International Publishing AG Springer International Publishing |
| Publisher_xml | – name: Springer Nature – name: Springer International Publishing AG – name: Springer International Publishing |
| SSID | ssj0001558521 |
| Score | 1.9430602 |
| Snippet | This book constitutes the proceedings of the 9th International Workshop on Frontiers in Algorithmics, FAW 2015, held in Guilin, China, in July 2015. The 28... |
| SourceID | askewsholts proquest casalini |
| SourceType | Aggregation Database Publisher |
| SubjectTerms | Computer algorithms Computer algorithms-Congresses Computer programming, programs, data |
| Subtitle | 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings |
| TableOfContents | 2.4 Overview -- 3 Polynomial-Time Algorithms -- 4 Intractability -- 5 Conclusion -- References -- The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation -- 1 Introduction -- 2 Generalized Leaf Removal and the Hybrid Algorithm -- 2.1 Core Percolation Transition -- 2.2 The Hybrid Algorithm -- 3 Spin Glass Model and Belief-Propagation -- 4 Conclusion -- References -- A Linear Time Algorithm for Ordered Partition -- 1 Introduction -- 2 Overview -- 3 Preparation -- 3.1 Perfect Hash Function -- 3.2 Converting Ordered Partition with Integers of plogn Bits to that with Integers of p1/3logn Bits -- 3.3 Nonconservative Integer Sorting -- 4 Ordered Partition of T by S -- 5 Ordered Partition -- 6 Randomization and Nonconservativeness -- 7 Conclusion -- References -- Machine Scheduling with a Maintenance Interval and Job Delivery Coordination -- 1 Introduction -- 2 The Algorithm D-NF-SPT -- 2.1 A Tight Instance -- 3 Conclusions -- References -- Lower and Upper Bounds for Random Mimimum Satisfiability Problem -- 1 Introduction -- 2 Preliminaries -- 3 The Upper Bound -- 4 The Lower Bound -- 5 Experimental Results -- 6 Conclusions and Future Work -- References -- On Solving Systems of Diagonal Polynomial Equations Over Finite Fields -- 1 Introduction -- 2 Warm-Up: The Quadratic and Cubic Cases -- 2.1 The Quadratic Case -- 2.2 The Cubic Case -- 3 The General Case -- 3.1 The Reduction When d is Even -- 3.2 The Algorithm When [d]-1Fp -- References -- Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints -- 1 Introduction -- 2 Patterns and the User-Iterative Algorithm -- 3 The Pattern-Backtracking Algorithm -- 3.1 Pattern Validity Test -- 3.2 The Backtracking Algorithm -- 4 Comparison of the PB and UI Algorithms -- 5 Computational Experiments -- 6 Conclusion -- References On the Sound Covering Cycle Problem in Paired de Bruijn Graphs -- 1 Introduction -- 2 Cycle-Walk Decompositions -- 3 An Algorithm for the Parameters n and d -- 4 Shortest Sound Cycles and Approximately Sound Cycles -- 5 A Tractable Special Case for the Parameter n -- 6 Outlook -- References -- Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties -- 1 Introduction -- 2 Multilevel Facility Location Problem with Submodular Penalties -- 3 Multilevel Facility Location Problem with Linear Penalties -- References -- Smaller Kernels for Several FPT Problems Based on Simple Observations -- 1 Introduction -- 2 Preliminaries -- 3 Co-Path Set and Linear Arrangement by Deleting Edges -- 3.1 Reduction Rules -- 3.2 Kernel Analysis -- 4 Path-Contractibility -- 4.1 Reduction Rule and Kernel Analysis -- 5 Connected Dominating Set on G7 graphs -- 5.1 Reduction Rule and Kernel Analysis -- References -- Parameterized Minimum Cost Partition of a Tree with Supply and Demand -- 1 Introduction -- 2 Preliminaries -- 3 Kernelization for PPTSD -- 4 A Parameterized Algorithm for PPTSD -- 5 Conclusion -- References -- The Online Storage Strategy for Automated Storage and Retrieval System with Single Open in One Dimension -- 1 Introduction -- 2 Problem Statement and Notations -- 3 -Sorted Strategy -- 4 Conclusion -- References -- Union Closed Tree Convex Sets -- 1 Introduction -- 2 Preliminaries -- 3 Main Results -- 4 Conclusions -- References -- Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores -- 1 Introduction -- 2 Preliminaries -- 3 Quantum Algorithm for LSR -- 4 Quantum Algorithm for Calculating Statistic Leverage Scores and Matrix Coherence -- References -- A New Distributed Algorithm for Computing a Dominating Set on Grids -- 1 Introduction -- 2 Preliminaries 5 Reducing the Time Complexity via Dynamic Programming -- 6 Concluding Remarks -- References -- Enumeration, Counting, and Random Generation of Ladder Lotteries -- 1 Introduction -- 2 Preliminaries -- 3 Enumeration -- 4 Counting -- 5 Random Generation -- 6 Summary -- References -- Efficient Modular Reduction Algorithm Without Correction Phase -- 1 Introduction -- 2 Preliminaries -- 2.1 Euclidean Division -- 2.2 Barrett Reduction -- 2.3 Improved Barrett Algorithm -- 3 The Proposed Modular Reduction Algorithm -- 3.1 Mathematical Algorithm of the Proposed Modular Reduction -- 3.2 Hardware Implementation -- 4 Conclusion -- References -- Super Solutions of Random Instances of Satisfiability -- 1 Introduction -- 2 Super Solutions for Boolean Satisfiability -- 2.1 Equivalent Definitions of (1, 0)-Super Solutions -- 2.2 Random Models of k-SAT -- 2.3 An Exact Threshold for the Solution Probability of (1,0)-3-SAT -- 2.4 Thresholds for the Solution Probability of (1,0)-k-SAT -- 3 Super Solutions for Random Binary CSPs -- 4 Conclusions -- References -- A Data Streams Analysis Strategy Based on Hadoop Scheduling Optimization for Smart Grid Application -- Abstract -- 1 Introduction -- 2 Related Works -- 3 Implementation of Massive Data Streams Analysis Strategy for Smart Grid Monitoring System -- 3.1 Cloud Computing Architecture for Smart Grid Application -- 3.2 Power Data Streams Analysis Strategy Based on Hadoop Scheduling Optimization Method -- 4 Performance Evaluation -- 5 Conclusion -- References -- Author Index Intro -- Preface -- Organization -- Contents -- Invited Talks -- Graph Modification Problems: A Modern Perspective -- References -- Soft Subdivision Search in Motion Planning, II: Axiomatics -- 1 Introduction -- 2 The SSS Framework -- 3 Generalized Setting for SSS -- 4 Axiomatic Properties of SSS -- 5 What About Exactness? -- 6 Conclusion -- References -- Contributed Papers -- On r-Gatherings on the Line -- 1 Introduction -- 2 (k,r)-Gathering on the Line -- 3 -Gathering on the Line -- 4 -Gather Clustering -- 5 Outlier -- 6 Conclusion -- References -- A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow -- 1 Introduction -- 2 The IDS Problem -- 3 Binary Tree Model for the IDS Problem -- 3.1 S-C Tree Model -- 3.2 Proofs of the Theorems -- 4 Algorithm for the IDS Problem Based on the S-C Tree -- 5 Conclusions -- References -- Efficient Computation of the Characteristic Polynomial of a Threshold Graph -- 1 Introduction -- 2 The Determinant of a Weighted Threshold Graph Matrix -- 3 Computation of the Characteristic Polynomial of a Threshold Graph -- 4 Complexity in the Bit Model -- 5 Open Problems -- References -- A Fast and Practical Method to Estimate Volumes of Convex Polytopes -- 1 Introduction -- 2 The Volume Estimation Algorithm -- 2.1 Rounding -- 2.2 Subdivision -- 2.3 Hit-and-Run -- 2.4 Reutilization of Sample Points -- 2.5 Framework of the Algorithm -- 3 Experimental Results -- 3.1 The Performance of PolyVest -- 3.2 Result Checking -- 3.3 The Performance of Two Hit-and-Run Method -- 3.4 The Advantage of Reutilization of Sample Points -- 4 Related Works -- 5 Conclusion -- A About the Number of Sample Points -- References -- Social Models and Algorithms for Optimization of Contact Immunity of Oral Polio Vaccine -- 1 Introduction -- 2 Preliminaries -- 2.1 Definitions and Notations -- 2.2 Models -- 2.3 Problems 3 Chang's Centralized Constructive Method Revisited -- 4 Distributed Grid Domination -- 4.1 Model and Notation -- 4.2 Outline of Our Distributed Algorithm -- 4.3 Initialization -- 4.4 Settlement -- 4.5 Termination -- 4.6 The Algorithm -- 5 Conclusions -- References -- Approximate Model Counting via Extension Rule -- 1 Introduction -- 2 Model Counting Using Extension Rule -- 2.1 Extension Rule -- 2.2 Model Counting Using Extension Rule -- 3 Approximate Model Counting Using Extension Rule -- 3.1 ULBApprox -- 3.2 SampleApprox -- 4 Experimental Results -- 5 Conclusions -- References -- Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory -- 1 Introduction -- 2 FS-ISD -- 3 The New Algorithm -- 3.1 The Motivation -- 3.2 The New Algorithm -- 3.3 The Complexity -- 3.4 Comparison -- 4 Conclusions -- A Proof of Lemma 4 -- B Proof of Lemma 6 -- C Proof of Lemma 7 -- References -- Truthful Strategy and Resource Integration for Multi-tenant Data Center Demand Response -- 1 Introduction -- 2 Reward System and Truthful Strategy Design -- 2.1 Rewards System -- 2.2 Truthful Strategy -- 3 Model Analysis and Algorithm Design -- 3.1 Complexity Analysis -- 3.2 The Off-line and On-line Algorithms -- 4 Experimental Results -- 5 Conclusion -- References -- Local Search to Approximate Max NAE-k-Sat Tightly -- 1 Introduction -- 2 Local Search for Max NAE-k-SAT -- 2.1 The Algorithm and Its Performance -- 2.2 The Time Complexity -- 3 The Complexity of Approximating Max NAE-k-SAT -- 4 Local Search for Max NAE-(k)-SAT -- 5 Conclusion -- References -- Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Structural Properties -- 4 The Branch-and-Search Algorithm -- 4.1 Part I of the Algorithm Where S = ∅ -- 4.2 Part II of the Algorithm Where S |
| Title | Frontiers in Algorithmics |
| URI | http://digital.casalini.it/9783319196473 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=5588209 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=6299303 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783319196473 |
| Volume | 9130 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3JTsMwELWgXOiFXZQCihDXIBLbWY6lKlQVcCqlnCKvUFFaRAJCfD3jbE0LAsHFii3Hkec5nsWeGYSOCQdQqVC21Mq1CWPcDjylbUK1ECQQOLubc3XtdW9Ib0iHsySpqXdJwk_Ex7d-Jf9BFdoAV-Ml-wdky0GhAZ4BXygBYSgXhN-ymuccMmEHTBLr1Fwxvp-Civ_wVLm4fpubgXuA_vuoXAB37Dk7Y1eqqu47dEHdL8x9CwbDis2qdTGnImL4x0zQrSy3SbHnhU5-GjIfa7pz1vaAP2ETPnXZ90GZXWl1epeDmdWKgnrhOsZJphg3i65Y-U4d1Vn8CFs0bN9JbPg9i5lx8_zC7lIe3l9HK8o4dmygJTXZRGtFOgsr3922UKOkqjWaWFWqbqPBeaff7tp55gibYcOBbUdoqX2lMeGnzNGBoJxSKUEeUoK6gfYJiCaB8rAXAn_2ZKg8VxLGQZnTLOAY76DaZDpRu8iiUHW4dgmXDuGu5iE3sxTSDwMJAlUDHVWmG72N01PuOKrQxMcN1CyoEMEizKKRxxElJriH10BWQZgofTu_mBsBHkBwENLCn7rkkO393qWJVmdrah_VkpdXdQBCVcIPc6Q_ASyzIlk |
| 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&rft.au=Wang%2C+Jianxin&rft.au=Yap%2C+Chee&rft.date=2015-01-01&rft.pub=Springer+International+Publishing+AG&rft.isbn=9783319196466&rft.volume=9130&rft.externalDocID=EBC6299303 |
| thumbnail_m | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97833191%2F9783319196473.jpg |