Author:
Kao Mong-Jen,Katz Bastian,Krug Marcus,Lee D. T.,Rutter Ignaz,Wagner Dorothea
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Bálint, V.: The non-approximability of bicriteria network design problems. J. of Discrete Algorithms 1, 339–355 (2003)
2. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. In: STOC 1993: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 226–234. ACM, New York (1993)
3. Chinchuluun, A., Pardalos, P.: A survey of recent developments in multiobjective optimization. Annals of Operations Research 154, 29–50 (2007)
4. Chung, K.-M., Lu, H.-I.: An optimal algorithm for the maximum-density segment problem. SIAM J. Comput. 34(2), 373–387 (2005)
5. Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. In: Proc. 6th Ann. ACM-SIAM Sympos. Disc. Alg., pp. 632–640. SIAM, Philadelphia (1995)