✦ LIBER ✦

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 2108 || Competitive Facility Location along a Highway

✍ Scribed by Wang, Jie

Book ID: 121663722
Publisher: Springer Berlin Heidelberg
Year: 2001
Weight: 170 KB
Category: Article
ISBN: 3540446796
DOI: 10.1007/3-540-44679-6_26

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 2108 || Graph Separators: A Parameterized View

✍ Wang, Jie 📂 Article 📅 2001 🏛 Springer Berlin Heidelberg ⚖ 206 KB

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 2108 || A New Measure of Edit Distance between Labeled Trees

✍ Wang, Jie 📂 Article 📅 2001 🏛 Springer Berlin Heidelberg ⚖ 243 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorics and Computer Science Volume 1120 || Contiguity orders

✍ Deza, Michel; Euler, Reinhardt; Manoussakis, Ioannis 📂 Article 📅 1996 🏛 Springer Berlin Heidelberg ⚖ 690 KB

[Lecture Notes in Computer Science] Cons

[Lecture Notes in Computer Science] Constructivity in Computer Science Volume 613 || Constructive topology and combinatorics

✍ Myers, J. Paul; O'Donnell, Michael J. 📂 Article 📅 1992 🏛 Springer Berlin Heidelberg ⚖ 288 KB

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 6196 || Auspicious Tatami Mat Arrangements

✍ Thai, My T.; Sahni, Sartaj 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 215 KB

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 4112 || Computing Maximum-Scoring Segments in Almost Linear Time

✍ Chen, Danny Z.; Lee, D. T. 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 362 KB

This Book Presents The Refereed Proceedings Of The 12th Annual International Computing And Combinatorics Conference, Cocoon 2006, Held In Taipei, Taiwan, August 2006. The Book Offers 52 Revised Full Papers Presented Together With Abstracts Of 2 Invited Talks. The Papers Are Organized In Topical Sect