Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference21 articles.
1. Appel, K., Haken, W.: Every planar map is four colorable. Part I: discharging. Ill. J. Math. 21(3), 429–490 (1977)
2. Appel, K., Haken, W., Koch, J.: Every planar map is four colorable. Part II: reducibility. Ill. J. Math. 21(3), 491–567 (1977)
3. Arora, S.: Approximation schemes for NP-hard geometric optimization problems: a survey. Math. Program. 97(1–2), 43–69 (2003)
4. Brooks, R.L.: On colouring the nodes of a network. Math. Proc. Cambridge Philos. Soc. 37(2), 194–197 (1941)
5. Chepoi, V., Nouioua, K., Vaxès, Y.: A rounding algorithm for approximating minimum Manhattan networks. Theoret. Comput. Sci. 390(1), 56–69 (2008)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献