✍ Scribed by Freivalds, Rūsiņš
No coin nor oath required. For personal study only.
This Book Constitutes The Refereed Proceedings Of The 13th International Symposium Fundamentals Of Computation Theory, Fct 2001, As Well As Of The International Workshop On Efficient Algorithms, Wea 2001, Held In Riga, Latvia, In August 2001. The 28 Revised Full Fct Papers And 15 Short Papers Presented Together With Six Invited Contributions And 8 Revised Full Wea Papers As Well As Three Invited Wea Contributions Have Been Carefully Reviewed And Selected. Among The Topics Addressed Are A Broad Variety Of Topics From Theoretical Computer Science, Algorithmics And Programming Theory. The Wea Papers Deal With Graph And Network Algorithms, Flow And Routing Problems, Scheduling And Approximation Algorithms, Etc.
📜 SIMILAR VOLUMES
Networks Play A Central Role In Today’s Society, Since Many Sectors Employing Information Technology, Such As Communication, Mobility, And Transport - Even Social Interactions And Political Activities - Are Based On And Rely On Networks. In These Times Of Globalization And The Current Global Financi
The Four Volume Set Assembled Following The 2005 International Conference On Computational Science And Its Applications, Iccsa 2005, Held In Suntec International Convention And Exhibition Centre, Singapore, From 9 May 2005 Till 12 May 2005, Represents The ?ne Collection Of 540 Refereed Papers Select