"WALCOM : Algorithms and Computation" - Information and Links:

WALCOM : Algorithms and Computation - Info and Reading Options

15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28-March 2, 2021, Proceedings

"WALCOM : Algorithms and Computation" was published by Springer International Publishing AG in 2021 - Cham, it has 1 pages and the language of the book is English.


“WALCOM : Algorithms and Computation” Metadata:

  • Title: ➤  WALCOM : Algorithms and Computation
  • Authors:
  • Language: English
  • Number of Pages: 1
  • Publisher: ➤  Springer International Publishing AG
  • Publish Date:
  • Publish Location: Cham

Edition Specifications:

  • Weight: 0.539
  • Pagination: xv, 334

Edition Identifiers:

AI-generated Review of “WALCOM : Algorithms and Computation”:


"WALCOM : Algorithms and Computation" Description:

Open Data:

Intro -- Preface -- Organization -- Understanding the Complexity of Motion Planning (Abstract of Invited Talk) -- Contents -- Invited Talks -- Majority Spanning Trees, Cotrees and Their Applications -- 1 Preliminaries -- 2 Main Results -- 3 Applications -- 3.1 Minimum Connection Time Problem -- 3.2 Round-Robin Tournament Ranking -- 3.3 Balancing One Way Roads -- 3.4 Settling Multiple Debts -- 4 Conclusion -- References -- A New Transportation Problem on a Graph with Sending and Bringing-Back Operations -- 1 Introduction -- 2 Problem Definition -- 2.1 Formal Definitions and Basic Properties -- 3 One-Dimensional Transportation Problem -- 3.1 One-Commodity Problem Without Capacity Constraint -- 3.2 One-Commodity Transportation Problem with Loading Capacity -- 3.3 Optimization Problem -- 3.4 Multi-commodity Transportation Problem -- 4 Two-Dimensional Transportation Problem -- 4.1 NP-completeness -- 4.2 One-Commodity Transportation Problem on a Forest -- 5 Concluding Remarks -- References -- Long Papers -- Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Approach -- 2 Computing the Diameter of Unicycle Graphs -- 2.1 Observations -- 2.2 A Pruning Algorithm -- 2.3 Computing the Diameter -- 3 The Diameter-Optimally Augmenting Trees (DOAT) -- 3.1 Observations -- 3.2 Reducing DOAT to Finding a Shortcut for P -- 3.3 Computing an Optimal Shortcut for P -- References -- On Short Fastest Paths in Temporal Graphs -- 1 Introduction -- 1.1 Temporal Graphs -- 1.2 Our Result -- 2 Dominating Paths -- 3 An Algorithm for Short Fastest Paths -- 4 Correctness -- 5 Running Time -- References -- Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights -- 1 Introduction -- 2 Preliminaries -- 2.1 Evacuation Completion Time on a Dynamic Flow Path Network

Read “WALCOM : Algorithms and Computation”:

Read “WALCOM : Algorithms and Computation” by choosing from the options below.

Search for “WALCOM : Algorithms and Computation” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “WALCOM : Algorithms and Computation” in Libraries Near You:

Read or borrow “WALCOM : Algorithms and Computation” from your local library.

Buy “WALCOM : Algorithms and Computation” online:

Shop for “WALCOM : Algorithms and Computation” on popular online marketplaces.