Skip to main content
Springer Nature Link
Log in

Balanced tree partition problems with virtual nodes

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

We study two variants of the Balanced Tree Partition (BTP for short) problem, whose goal is to find the minimum number of edges such that a partition of vertices into sets of equal size can be obtained after deleting those edges. We consider the BTP problem over trees with virtual nodes, which is motivated by the real applications in storing tree structured data distributively. Different from the traditional BTP problem, after deleting an edge from the tree, two virtual nodes must be added to provide the ability to recover the edge when computing, which will increase the size of some set in the partition and the set may become too large and need further splitting. Depending on whether or not to consider the partition set number k to be a parameter, to investigate the balanced tree partition methods over trees with virtual nodes, we formally defined two specific problems, \(k\)-VBTP and VBTP. The computational complexity and inapproximability of \(k\)-VBTP are analyzed, for the VBTP problem, a polynomial time algorithm is designed to find the optimal solution based on dynamic programming. Finally, the connections between \(k\)-VBTP and VBTP are built, and based the algorithm for VBTP, we design a heuristic algorithm for \(k\)-VBTP with performance guarantee.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Abitrboul S, Benjellourn O, Manolescu I, Milo T, Weber R (2002) Active XML: peer-to-peer data and web services integration. In: Proceedings of the 28th international conference on very large data bases, VLDB ’02. VLDB Endowment, pp 1087–1090

  • Andreev K, Räcke H (2004) Balanced graph partitioning. In: Proceedings of the 16th annual ACM symposium on parallelism in algorithms and architectures, SPAA ’04, New York, NY, USA. ACM, pp 120–124

  • Andreev K, Racke H (2006) Balanced graph partitioning. Theor. Comp. Syst. 39(6):929–939

    Article  MathSciNet  MATH  Google Scholar 

  • Arbenz P, Van Lenthe G, Harry MU, Müller R, Sala M (2007) Multi-level mu-finite element analysis for human bone structures. In: Proceedings of the 8th international conference on applied parallel computing: state of the art in scientific computing, PARA’06. Springer, Berlin, pp 240–250

  • Arora S, Rao S, Vazirani U (2009) Expander flows, geometric embeddings and graph partitioning. J ACM 56(2):5:1–5:37

    Article  MathSciNet  MATH  Google Scholar 

  • Bansal N, Coppersmith D, Schieber B (2006) Minimizing setup and beam-on times in radiation therapy. In: Proceedings of the 9th international conference on approximation algorithms for combinatorial optimization problems, and 10th international conference on randomization and computation, APPROX’06/RANDOM’06. Springer, Berlin, pp 27–38

  • Bhatt SN, Leighton FT (1983) A framework for solving vlsi graph layout problems. Technical report, Massachusetts Institute of Technology, Cambridge, MA, USA

  • Bhatt SN, Leighton FT (1984) A framework for solving vlsi graph layout problems. J Comput Syst Sci 28(2):300–343

    Article  MathSciNet  MATH  Google Scholar 

  • Bodlaender HL, Schuurman P, Woeginger GJ (2012) Scheduling of pipelined operator graphs. J Sched 15(3):323–332

    Article  MathSciNet  MATH  Google Scholar 

  • Bonifati A, Cuzzocrea A (2006) Storing and retrieving xpath fragments in structured p2p networks. Data Knowl Eng 59(2):247–269

    Article  Google Scholar 

  • Bremer J-M, Gertz M (2003) On distributing XML repositories. In: International workshop on web and databases, San Diego, California, June 12–13, 2003, pp 73–78

  • Cai Z, Chen Z-Z, Lin G (2009) A 3.4713-approximation algorithm for the capacitated multicast tree routing problem. Theor Comput Sci 410(52):5415–5424. https://doi.org/10.1016/j.tcs.2009.05.013

    Article  MathSciNet  MATH  Google Scholar 

  • Cai Z, Chen Z-Z, Lin G, Wang L (2008) An improved approximation algorithm for the capacitated multicast tree routing problem. In: Proceedings of the 2nd international conference on combinatorial optimization and applications, COCOA, 2008. Springer, Berlin, pp 286–295 https://doi.org/10.1007/978-3-540-85097-7_27

  • Cai Z, Goebel R, Lin G (2009) Size-constrained tree partitioning: a story on approximation algorithm design for the multicast k-tree routing problem. In: Proceedings of the 3rd international conference on combinatorial optimization and applications, COCOA ’09. Springer, Berlin, pp 363–374 https://doi.org/10.1007/978-3-642-02026-1_34

  • Cai Z, Goebel R, Lin G (2011) Size-constrained tree partitioning: approximating the multicast k-tree routing problem. Theor Comput Sci 412(3):240–245. https://doi.org/10.1016/j.tcs.2009.05.031

    Article  MathSciNet  MATH  Google Scholar 

  • Cai Z, Lin G, Xue G (2005) Improved approximation algorithms for the capacitated multicast routing problem. In: Proceedings of the 11th annual international conference on computing and combinatorics, COCOON’05. Springer, Berlin, pp 136–145. https://doi.org/10.1007/11533719_16

  • Cong G, Fan W, Kementsietsidis A, Li J, Liu X (2012) Partial evaluation for distributed xpath query processing and beyond. ACM Trans Database Syst 37(4):32:1–32:43

    Article  Google Scholar 

  • Delling D, Goldberg AV, Pajor T, Werneck RF (2011) Customizable route planning. In: Proceedings of the 10th international conference on experimental algorithms, SEA’11. Springer, Berlin, pp 376–387

  • Díaz J, Serna MJ, Torán J (1996) Parallel approximation schemes for problems on planar graphs. Acta Informatica 33(4):387–408

    Article  MathSciNet  MATH  Google Scholar 

  • Díaz J, Petit J, Serna M (2002) A survey of graph layout problems. ACM Comput Surv 34(3):313–356

    Article  Google Scholar 

  • Feldmann AE (2012) Fast balanced partitioning is hard even on grids and trees. In: Proceedings of the 37th international conference on mathematical foundations of computer science, MFCS’12. Springer, Berlin, pp 372–382

  • Feldmann AE, Foschini L (2015) Balanced partitions of trees and applications. Algorithmica 71(2):354–376

    Article  MathSciNet  MATH  Google Scholar 

  • Feldmann Andreas E, Widmayer P (2011) An o(n4) time algorithm to compute the bisection width of solid grid graphs. In: Proceedings of the 19th European conference on algorithms, ESA’11. Springer, Berlin, pp 143–154

  • Feldmann AE, Widmayer P (2011) Restricted cuts for bisections in solid grids: a proof via polygons. In: Proceedings of the 37th international conference on graph-theoretic concepts in computer science, WG’11. Springer, Berlin, pp 143–154

  • Feo T, Goldschmidt O, Khellaf M (1992) One-half approximation algorithms for the k-partition problem. Oper Res 40(S1):170–173

    Article  MATH  Google Scholar 

  • Feo TA, Khellaf M (1990) A class of bounded approximation algorithms for graph partitioning. Networks 20(2):181–195

    Article  MathSciNet  MATH  Google Scholar 

  • Jagadish HV, Lakshmanan Laks VS, Milo T, Srivastava D, Vista D (1999) Querying network directories. In: Proceedings of the 1999 ACM SIGMOD international conference on management of data, SIGMOD ’99, New York, NY, USA. ACM, pp 133–144

  • Kirkpatrick DG, Hell P (1978) On the completeness of a generalized matching problem. In: Proceedings of the 10th annual ACM symposium on theory of computing, STOC ’78, New York, NY, USA. ACM, pp 240–245

  • Krauthgamer R, Naor J, Schwartz R (2009) Partitioning graphs into balanced components. In: roceedings of the 20h annual ACM-SIAM symposium on discrete algorithms, SODA ’09, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics, pp 942–949

  • Kwatra V, Schödl A, Essa I, Turk G, Bobick A (2003) Graphcut textures: image and video synthesis using graph cuts. ACM Trans Graph 22(3):277–286

    Article  Google Scholar 

  • Lipton RJ, Tarjan RE (1980) Applications of a planar separator theorem. SIAM J Comput 9(3):615–627

    Article  MathSciNet  MATH  Google Scholar 

  • Lukes JA (1974) Efficient algorithm for the partitioning of trees. IBM J Res Dev 18(3):217–224

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the General Program of the National Natural Science Foundation of China under Grants 61732003, 61502121, 61772157, the China Postdoctoral Science Foundation under Grant 2016M590284, the Fundamental Research Funds for the Central Universities (Grant No. HIT.NSRIF.201649), and Heilongjiang Postdoctoral Foundation (Grant No. LBH-Z15094).

Author information

Authors and Affiliations

  1. Harbin Institute of Technology, Harbin, China

    Baoling Ning, Jianzhong Li & Shouxu Jiang

Authors
  1. Baoling Ning
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Jianzhong Li
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Shouxu Jiang
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Baoling Ning.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ning, B., Li, J. & Jiang, S. Balanced tree partition problems with virtual nodes. J Comb Optim 37, 1249–1265 (2019). https://doi.org/10.1007/s10878-018-0351-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-018-0351-1

Keywords