Abstract
We consider a framework for bi-objective network construction problems where one objective is to be maximized while the other is to be minimized. Given a host graph G = (V,E) with edge weights w e ∈ ℤ and edge lengths ℓ e ∈ ℕ for e ∈ E we define the density of a pattern subgraph H = (V′,E′) ⊆ G as the ratio \(\ensuremath{\varrho}(H)=\sum_{e\in E'}w_e/\sum_{e\in E'} \ell_e\). We consider the problem of computing a maximum density pattern H with weight at least W and and length at most L in a host G.
We consider this problem for different classes of hosts and patterns. We show that it is NP-hard even if the host has treewidth 2 and the pattern is a path. However, it can be solved in pseudo-polynomial linear time if the host has bounded treewidth and the pattern is a graph from a given minor-closed family of graphs. Finally, we present an FPTAS for a relaxation of the density maximization problem, in which we are allowed to violate the upper bound on the length at the cost of some penalty.
Supported by NSC-DFG Projects NSC98-2221-E-001-007-MY3 and WA 654/18.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bálint, V.: The non-approximability of bicriteria network design problems. J. of Discrete Algorithms 1, 339–355 (2003)
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)
Chinchuluun, A., Pardalos, P.: A survey of recent developments in multiobjective optimization. Annals of Operations Research 154, 29–50 (2007)
Chung, K.-M., Lu, H.-I.: An optimal algorithm for the maximum-density segment problem. SIAM J. Comput. 34(2), 373–387 (2005)
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)
Goldwasser, M.H., Kao, M.-Y., Lu, H.-I.: Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications. J. Comput. Syst. Sci. 70(2), 128–144 (2005)
Hsieh, S.-Y., Cheng, C.-S.: Finding a maximum-density path in a tree under the weight and length constraints. Information Processing Letters 105(5), 202–205 (2008)
Hsieh, S.-Y., Chou, T.-Y.: Finding a Weight-Constrained Maximum-Density Subtree in a Tree. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 944–953. Springer, Heidelberg (2005)
Inman, R.B.: A denaturation map of the lambda phage DNA molecule determined by electron microscopy. Journal of Molecular Biology 18(3), 464–476 (1966)
Kao, M.-J., Katz, B., Krug, M., Lee, D.T., Rutter, I., Wagner, D.: The density maximization problem in graphs. Technical Report 2011-2018, Kalrsruhe Institute of Technology, KIT (2011), http://digbib.ubka.uni-karlsruhe.de/volltexte/1000023123
Lee, D.T., Lin, T.-C., Lu, H.-I.: Fast algorithms for the density finding problem. Algorithmica 53(3), 298–313 (2009)
Lin, Y.-L., Jiang, T., Chao, K.-M.: Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. J. Comput. Syst. Sci. 65(3), 570–586 (2002)
Liu, H.-F., Chao, K.-M.: Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence. Theor. Comput. Sci. 407(1-3), 349–358 (2008)
Macaya, G., Thiery, J.-P., Bernardi, G.: An approach to the organization of eukaryotic genomes at a macromolecular level. Journal of Molecular Biology 108(1), 237–254 (1976)
Marathe, M.V., Ravi, R., Sundaram, R., Ravi, S.S., Rosenkrantz, D.J., Hunt, H.B.: Bicriteria network design problems. Journal of Algorithms 28(1), 142–171 (1998)
Overmars, M.H., van Leeuwen, J.: Maintenance of configurations in the plane. Journal of Computer and System Sciences 23(2), 166–204 (1981)
Schuurman, P., Woeginger, G.: Approximation schemes – a tutorial. Preliminary version of a chapter in the book ”Lectures on Scheduling”, (to appear, 2011)
Wu, B.Y.: An optimal algorithm for the maximum-density path in a tree. Inf. Process. Lett. 109(17), 975–979 (2009)
Wu, B.Y., Chao, K.-M., Tang, C.Y.: An efficient algorithm for the length-constrained heaviest path problem on a tree. Inf. Process. Lett. 69(2), 63–67 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kao, MJ., Katz, B., Krug, M., Lee, D.T., Rutter, I., Wagner, D. (2011). The Density Maximization Problem in Graphs. In: Fu, B., Du, DZ. (eds) Computing and Combinatorics. COCOON 2011. Lecture Notes in Computer Science, vol 6842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22685-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-22685-4_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22684-7
Online ISBN: 978-3-642-22685-4
eBook Packages: Computer ScienceComputer Science (R0)