Frontiers in Algorithmics 12th International Workshop, FAW 2018, Guangzhou, China, May 8-10, 2018, Proceedings
This book constitutes the refereed proceedings of the 12th International Workshop on Frontiers in Algorithmics, FAW 2018, held in Guangzhou, China, in May 2018.The 23 full papers presented in this volume were carefully reviewed and selected from 38 submissions. The papers of this workshop provide a...
Saved in:
| Main Authors | , |
|---|---|
| Format | eBook Conference Proceeding |
| Language | English |
| Published |
Cham
Springer Nature
2018
Springer International Publishing AG Springer International Publishing |
| Edition | 1 |
| Series | Lecture Notes in Computer Science |
| Subjects | |
| Online Access | Get full text |
| ISBN | 9783319784557 3319784552 3319784544 9783319784540 |
| ISSN | 0302-9743 1611-3349 |
| DOI | 10.1007/978-3-319-78455-7 |
Cover
| Abstract | This book constitutes the refereed proceedings of the 12th International Workshop on Frontiers in Algorithmics, FAW 2018, held in Guangzhou, China, in May 2018.The 23 full papers presented in this volume were carefully reviewed and selected from 38 submissions. The papers of this workshop provide a focused forum on current trends of research on algorithms, discrete structures, and their applications. |
|---|---|
| AbstractList | This book constitutes the refereed proceedings of the 12th International Workshop on Frontiers in Algorithmics, FAW 2018, held in Guangzhou, China, in May 2018.The 23 full papers presented in this volume were carefully reviewed and selected from 38 submissions. The papers of this workshop provide a focused forum on current trends of research on algorithms, discrete structures, and their applications. |
| Author | Lu, Pinyan Chen, Jianer |
| Author_xml | – sequence: 1 fullname: Chen, Jianer – sequence: 2 fullname: Lu, Pinyan |
| BookMark | eNpdkL1OwzAURg0URFv6AN0QC2Iw9W9sj6VqAakSC2K1HMduQ1O7xAFenzRhgelK3z3fke4dgUGIwQEwxegeIyRmSkhIIcUKCsk4h-IETNqMtkkXiFMwxBnGkFKmzv7tBmCIKCJQCUYvwAgjyjjDQqJLMEnpHSFEEBVckSGYruoYmtLV6boM1_NqE-uy2e5Lm67AuTdVcpPfOQZvq-Xr4gmuXx6fF_M1NKS1cEg889ZzYrjjQhKVS5wXKuMUyyL3TChpMlUI6zPjrSm8FcQhVzCOnKHWEToGd73YpJ37TttYNUl_VS6PcZf0n8Nadtaz6VCXYeNq3VMY6ePbjrSmuuV1V9DHxm3fONTx49OlRndi60JTm0ovHxYZkUh17puetCaZqgyl3scQN7U5bJNu_8e5FPQHERlxSA |
| ContentType | eBook Conference Proceeding |
| Copyright | Springer International Publishing AG, part of Springer Nature 2018 |
| Copyright_xml | – notice: Springer International Publishing AG, part of Springer Nature 2018 |
| DBID | I4C |
| DEWEY | 005 |
| DOI | 10.1007/978-3-319-78455-7 |
| DatabaseName | Casalini Torrossa eBooks Institutional Catalogue |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9783319784557 3319784552 |
| EISSN | 1611-3349 |
| Edition | 1 1st ed. 2018. |
| Editor | Lu, Pinyan Chen, Jianer |
| Editor_xml | – sequence: 1 fullname: Chen, Jianer – sequence: 2 fullname: Lu, Pinyan |
| ExternalDocumentID | 9783319784557 466240 EBC6280957 5415587 |
| GroupedDBID | 0D6 0DA 38. AABBV AEDXK AEKFX AEZAY ALMA_UNASSIGNED_HOLDINGS ANXHU BBABE BICGV BJAWL BUBNW CVGDX CZZ EDOXC FOYMO I4C IEZ LDH NQNQZ OEBZI SAO SBO TPJZQ TSXQS Z7R Z7X Z7Y Z81 Z83 Z88 AEJLV -DT -GH -~X 1SB 29L 2HA 2HV 5QI 875 AASHB ABMNI ACGFS ADCXD AEFIE EJD F5P FEDTE HVGLF LAS P2P RIG RNI RSU SVGTG VI1 ~02 Z7U |
| ID | FETCH-LOGICAL-a22035-2f4fcf52a5e57829b81bd965318dbf4798a69d7cf6afcadfc72e0ed450ea3ce23 |
| ISBN | 9783319784557 3319784552 3319784544 9783319784540 |
| ISSN | 0302-9743 |
| IngestDate | Fri Nov 08 04:09:51 EST 2024 Wed Oct 30 02:34:17 EDT 2024 Fri May 30 22:00:14 EDT 2025 Tue Nov 14 22:50:23 EST 2023 |
| IsPeerReviewed | true |
| IsScholarly | true |
| LCCallNum_Ident | Q |
| Language | English |
| LinkModel | OpenURL |
| MeetingName | International Workshop on Frontiers in Algorithmics |
| MergedId | FETCHMERGED-LOGICAL-a22035-2f4fcf52a5e57829b81bd965318dbf4798a69d7cf6afcadfc72e0ed450ea3ce23 |
| OCLC | 1034541780 |
| PQID | EBC6280957 |
| PageCount | 322 |
| ParticipantIDs | askewsholts_vlebooks_9783319784557 springer_books_10_1007_978_3_319_78455_7 proquest_ebookcentral_EBC6280957 casalini_monographs_5415587 |
| PublicationCentury | 2000 |
| PublicationDate | 2018 2018-04-28 |
| PublicationDateYYYYMMDD | 2018-01-01 2018-04-28 |
| PublicationDate_xml | – year: 2018 text: 2018 |
| PublicationDecade | 2010 |
| PublicationPlace | Cham |
| PublicationPlace_xml | – name: Netherlands – name: Cham |
| PublicationSeriesSubtitle | Theoretical Computer Science and General Issues |
| PublicationSeriesTitle | Lecture Notes in Computer Science |
| PublicationSeriesTitleAlternate | Lect.Notes Computer |
| PublicationYear | 2018 |
| Publisher | Springer Nature Springer International Publishing AG Springer International Publishing |
| Publisher_xml | – name: Springer Nature – name: Springer International Publishing AG – name: Springer International Publishing |
| RelatedPersons | Kleinberg, Jon M. Mattern, Friedemann Naor, Moni Mitchell, John C. Terzopoulos, Demetri Steffen, Bernhard Pandu Rangan, C. Kanade, Takeo Kittler, Josef Weikum, Gerhard Hutchison, David Tygar, Doug |
| RelatedPersons_xml | – sequence: 1 givenname: David surname: Hutchison fullname: Hutchison, David – sequence: 2 givenname: Takeo surname: Kanade fullname: Kanade, Takeo – sequence: 3 givenname: Josef surname: Kittler fullname: Kittler, Josef – sequence: 4 givenname: Jon M. surname: Kleinberg fullname: Kleinberg, Jon M. – sequence: 5 givenname: Friedemann surname: Mattern fullname: Mattern, Friedemann – sequence: 6 givenname: John C. surname: Mitchell fullname: Mitchell, John C. – sequence: 7 givenname: Moni surname: Naor fullname: Naor, Moni – sequence: 8 givenname: C. surname: Pandu Rangan fullname: Pandu Rangan, C. – sequence: 9 givenname: Bernhard surname: Steffen fullname: Steffen, Bernhard – sequence: 10 givenname: Demetri surname: Terzopoulos fullname: Terzopoulos, Demetri – sequence: 11 givenname: Doug surname: Tygar fullname: Tygar, Doug – sequence: 12 givenname: Gerhard surname: Weikum fullname: Weikum, Gerhard |
| SSID | ssj0002037592 ssj0002792 |
| Score | 2.4100556 |
| Snippet | This book constitutes the refereed proceedings of the 12th International Workshop on Frontiers in Algorithmics, FAW 2018, held in Guangzhou, China, in May... |
| SourceID | askewsholts springer proquest casalini |
| SourceType | Aggregation Database Publisher |
| SubjectTerms | Algorithm Analysis and Problem Complexity Artificial Intelligence Computation by Abstract Devices Computer algorithms-Congresses Computer programming, programs, data Computer Science Data Structures Discrete Mathematics in Computer Science Numeric Computing |
| Subtitle | 12th International Workshop, FAW 2018, Guangzhou, China, May 8-10, 2018, Proceedings |
| TableOfContents | References -- Other Algorithms -- On Bayesian Epistemology of Myerson Auction -- 1 Introduction -- 2 Preliminaries -- 2.1 Myerson Auction Against Strategic Bidding Distributions -- 3 Main Model -- 3.1 Power-Law Distributions -- 3.2 Half-Normal Distributions -- 3.3 Exponential Distribution -- 3.4 Pictorial Representation -- 4 Conclusions -- References -- Low-Weight Superimposed Codes and Their Applications -- 1 Superimposed Codes -- 1.1 Conflict Resolution in Wireless Networks with Bounded Number of Transmissions -- 1.2 Group Testing -- 1.3 Additional Applications -- 2 Our Results in Perspective -- 3 Proof of Theorem1 -- 4 Selectors -- References -- Single Vehicle's Package Delivery Strategy with Online Traffic Congestion of Certain Delay Time -- Abstract -- 1 Introduction -- 1.1 Literature Review -- 1.2 Our Contributions -- 2 Preliminaries -- 2.1 Problem Statement -- 3 A Lower Bound -- 4 An Algorithm for Online STSP-CDT Problem -- 4.1 Notations -- 4.2 Execution of Greedy Routing -- 4.3 Competitive Analysis on Greedy Routing -- 5 Conclusion -- Acknowledgments -- References -- The Complexity of Weak Consistency -- 1 Introduction -- 2 Preliminaries -- 2.1 Sets, Relations and Labeled Posts -- 2.2 Histories and Specifications -- 3 Weak Consistency -- 3.1 Weak Consistency: Informal Description -- 3.2 Weak Consistency: A Formal Definition -- 4 The Testing Problem of Weak Consistency -- 5 Restricted TWC Problems -- 5.1 Restricting the Number of Accesses -- 5.2 Restricting the Number of Processes -- 5.3 TWC-Read Problem with Two Processes is in P -- 6 Undecidability of Verifying Weak Consistency -- 7 Related Work -- 8 Conclusion -- References -- Balanced Random Constraint Satisfaction: Phase Transition and Hardness -- 1 Introduction -- 2 Preliminaries -- 3 Model NB and Model UB -- 4 Phase Transitions of Model NB and UB 5 Experimental Hardness of Model NB/UB -- 6 Conclusion -- References -- Exact Algorithms for Allocation Problems -- 1 Introduction -- 2 Santa Claus Problem with Non Additive Valuations -- 3 A O*(2m) Algorithm for the Santa Claus Problem -- 3.1 Dynamic Programming Formulation -- 4 O*(2m) Algorithms for Makespan Minimization and Bin Packing -- 4.1 Dynamic Programming Formulation -- 5 Santa Claus Problem with Capacity Constraints -- References -- Exact Algorithms for the Max-Min Dispersion Problem -- 1 Introduction -- 2 Relationship with the Maximum Independent Set Problem -- 2.1 General Case -- 2.2 On the Euclidean Plane -- 3 Max-Min Dispersion on a Line -- 4 Max-Min k-dispersion on a Circle -- 5 Conclusion -- References -- Non-orthogonal Homothetic Range Partial-Sum Query on Integer Grids -- 1 Introduction -- 2 Square Shape Range Partial Sum Query Problem -- 3 Triangular Range Query Problem -- 4 Future Work and Open Problems -- 5 Related Work -- References -- A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals -- Abstract -- 1 Introduction -- 2 The Frequency Quadrilaterals -- 3 The Iterative Algorithm -- 4 The Experiments and Analysis -- 5 Conclusions -- Acknowledgement -- References -- Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints -- 1 Introduction -- 2 Constraint Preliminaries -- 2.1 Constraint Network Presentation -- 3 Statement of Problem -- 4 Motivation and Related Work -- 5 A Path Following Approach -- 5.1 Resource Analysis -- 5.2 Correctness -- 6 A Randomized Approach -- 6.1 Resource Analysis -- 6.2 Correctness -- 7 Conclusion -- References -- Author Index Intro -- Preface -- Organization -- Contents -- Graph Algorithms -- Two Kinds of Generalized 3-Connectivities of Alternating Group Networks -- 1 Introduction -- 2 Background of Alternating Group Networks -- 3 The Generalized 3-Connectivity 3'(ANn) -- 4 The Generalized 3-Connectivity 3(ANn) -- 5 Concluding Remarks -- References -- On the Longest Spanning Tree with Neighborhoods -- 1 Introduction -- 2 Approximation Algorithms -- 3 Analysis of Algorithm A2 -- 4 Conclusion -- References -- Efficient Algorithms for a Graph Partitioning Problem -- 1 Introduction -- 1.1 Related Work -- 1.2 Paper Organization -- 2 Minimum Spanning k-forest of a Graph Having Equal Weighted Edges -- 3 Minimum Spanning k-forest of a Tree -- 4 Exact Exponential Algorithm for Finding a Minimum Spanning k-forest of a Graph -- 5 Conclusion -- References -- On the Minmax Regret Path Center Problem on Trees -- Abstract -- 1 Introduction -- 2 Notation and Definitions -- 3 Puerto, Ricca, and Scozzari's Algorithm -- 4 The Entry Vertex Problem -- 4.1 Preprocessing -- 4.2 Algorithm for Queries -- 4.3 An Extended Problem -- 5 An Improved Algorithm for the Path Center Problem -- References -- A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees -- 1 Introduction -- 2 Preliminaries -- 3 Algorithm for the Maximum Supply Rate Problem -- 3.1 Outline -- 3.2 Algorithm Description -- 4 Running Time -- 5 Extension to the Maximum Supply Parameter Problem -- References -- The Maximum Distance-d Independent Set Problem on Unit Disk Graphs -- 1 Introduction -- 2 Related Work -- 2.1 Our Work -- 2.2 Organization -- 3 The GMDdIS Problem on Unit Disk Graphs -- 4 Approximation Algorithm -- 4.1 Solving a d d Square Optimally -- 5 Approximation Scheme -- 5.1 Computing an Optimum Solution in a k k Square -- 6 Conclusion -- References New Approximation Algorithms for the Minimum Cycle Cover Problem -- 1 Introduction -- 2 Preliminaries -- 3 A Simple 245-Approximation -- 4 A Faster 143-Approximation -- 5 327-Approximation -- References -- Parameterized Algorithms -- Parameterized Algorithms for Minimum Tree Cut/Paste Distance and Minimum Common Integer Partition -- 1 Introduction -- 2 Preliminaries and Hardness Results -- 3 An Algorithm for Minimum Tree Cut/Paste Distance -- 4 An Algorithm for Minimum Common Integer Partition -- References -- Guarding Polyhedral Terrain by k-Watchtowers -- 1 Introduction -- 2 Preliminaries -- 3 The Decision Procedure -- 4 Algorithm via Discretisation of Height -- 4.1 Phase 1: Critical-Height Generation -- 4.2 Phase 2: Contact-Height Generation -- 5 Conclusion -- References -- Some (in)tractable Parameterizations of Coloring and List-Coloring -- 1 Introduction -- 1.1 Problems and Motivation -- 1.2 Parameterized Complexity -- 1.3 Our Results -- 1.4 Organization of the Paper -- 1.5 Related Work -- 2 Hardness Results -- 3 (n-k)-regular List coloring Is in XP -- 4 Deleting k Vertices or Edges to Satisfy 2-regular List coloring -- 5 Conclusions -- References -- Kernelization for P2-Packing: A Gerrymandering Approach -- 1 Introduction -- 2 Preliminaries -- 3 The Unit Partition -- 4 Main Rules -- 5 Kernelization Algorithm -- References -- Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & -- Editing Problems -- 1 Introduction -- 2 Preliminaries -- 3 Our Results -- 3.1 Hardness Results -- 3.2 An FPT Algorithm for d-SC1P-0E Problem -- 4 Conclusion -- References -- Improved Kernels for Several Problems on Planar Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Improved Kernel for the Induced Matching Problem on Planar Graphs -- 4 Improved Kernel for the Parameterized Planar 4-Cycle Transversal Problem |
| Title | Frontiers in Algorithmics |
| URI | http://digital.casalini.it/9783319784557 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=6280957 http://link.springer.com/10.1007/978-3-319-78455-7 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783319784557 |
| Volume | 10823 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEA66XvTiG9cXRTwIUtlN0yQ9eFBZEVHxoOItpG2iou6CrR789c60Tdtd9qBeSkkfSWeayUxm5htC9pnGv0YYvx8mwmcRtz6u6z5o2tImJpWMYjby9Q2_uGeXj-FjA2RTZJfk8VHyPTWv5D9chTbgK2bJ_oGz9UuhAc6Bv3AEDsNxQvmdus6cI_gAlrIuNi3enkZg6D-_u_B1HIHJjq8qJ8HNKC9irw5dHQc3rdt2f19O2P1u329i57DZvBozFAOYaUIi2l5LvgQgDMGcKOWLKeUfR1TDoEQRrQUkeuOmitt2hAVmQ2EXoS-ataWO-GOcg-4wS2aF7HXI3Mng8uqh3gujWIg3amC_ENSw9P6UA8ScHPcBJZhj64Ocq7pCCx4byAJZ0NkrrBawkuQZqh4605hxOmZPTLjAC83ibomsNTmX3m3N5WUyY4YrZNExy6uYtUq6Nde9l6HX5voaeTgf3J1d-FV9C19TilCh1DKb2JDq0GBVgSgGGyKNOIhFmcaWiUhqHqUisVzbRKc2EdT0TMrCntFBYmiwTjrD0dBsEK9n-9aaQKeBZUwb9O4CRSwXNIZWI7tkr0UJ9fVW-OIz1SJlKLpkyxFIwVQpMdMzFaLSKeGq52imiqer8GE1OD3jVIKuDrccOFqq8v0OFRt6UIGCnlTRlRKbv791i8w3E2CbdPKPT7MDqmAe71Z_0g--4VKS |
| 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=proceeding&rft.title=Frontiers+in+Algorithmics&rft.series=Lecture+Notes+in+Computer+Science&rft.date=2018-01-01&rft.pub=Springer+International+Publishing&rft.isbn=9783319784540&rft.issn=0302-9743&rft.eissn=1611-3349&rft.volume=10823&rft_id=info:doi/10.1007%2F978-3-319-78455-7&rft.externalDocID=466240 |
| thumbnail_m | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97833197%2F9783319784557.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-319-78455-7 |