Skip to main content
SpringerLink
Log in

ILP formulation of the degree-constrained minimum spanning hierarchy problem

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

Abstract

Given a connected edge-weighted graph G and a positive integer B, the degree-constrained minimum spanning tree problem (DCMST) consists in finding a minimum cost spanning tree of G such that the degree of each vertex in the tree is less than or equal to B. This problem, which has been extensively studied over the last few decades, has several practical applications, mainly in networks. However, some applications do not especially impose a subgraph as a solution. For this purpose, a more flexible so-called hierarchy structure has been proposed. Hierarchy, which can be seen as a generalization of trees, is defined as a homomorphism of a tree in a graph. In this paper, we discuss the degree-constrained minimum spanning hierarchy (DCMSH) problem which is NP-hard. An integer linear program (ILP) formulation of this new problem is given. Properties of the solution are analysed, which allows us to add valid inequalities to the ILP. To evaluate the difference of cost between trees and hierarchies, the exact solution of DCMST and z problems are compared. It appears that, in sparse random graphs, the average percentage of improvement of the cost varies from 20 to 36% when the maximal authorized degree of vertices B is equal to 2, and from 11 to 31% when B is equal to 3. The improvement increases as the graph size increases.

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

Access this article

Log in via an institution

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
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  • Ali M, Deogun JS (2000) Power-efficient design of multicast wavelength-routed networks. IEEE J Sel Areas Commun 18(10):1852–1862. doi:10.1109/49.887907

    Article  Google Scholar 

  • Bauer F, Varma A (1995) Degree-constrained multicasting in point-to-point networks. In: Proceedings of IEEE INFOCOM, pp 369–376

  • Cerulli R, Gentili M, Iossa A (2009) Bounded-degree spanning tree problems: models and new algorithms. Comput Optim Appl 42(3):353–370

    Article  MathSciNet  MATH  Google Scholar 

  • Christofides N, Mingozzi A, Toth P (1981) Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math Programm 20(1):255–282. doi:10.1007/BF01589353

    Article  MathSciNet  MATH  Google Scholar 

  • Cornuéjols G, Fonlupt J, Naddef D (1985) The traveling salesman problem on a graph and some related integer polyhedra. Math Programm 33(1):1–27. doi:10.1007/BF01582008

    Article  MathSciNet  MATH  Google Scholar 

  • Deo N, Hakimi L (1968) The shortest generalized hamiltonian tree. In: 6th annual allerton conference, Illinois, pp 879–888

  • Fleischmann B (1985) A cutting plane procedure for the travelling salesman problem on road networks. Eur J Oper Res 21(3):307–317

    Article  MathSciNet  MATH  Google Scholar 

  • Furer M, Raghavachari B (1992) Approximating the minimum degree spanning tree to within one from the optimal degree. In: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, SODA ’92, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp 317–324

  • Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co, New York

    MATH  Google Scholar 

  • Goemans M (2006) Minimum bounded degree spanning trees. In: 47th annual IEEE symposium on foundations of computer science, 2006. FOCS ’06, pp 273–282

  • Hell P, Zhu X (1994) Homomorphisms to oriented paths. Discrete Math 132(1):107–114

    Article  MathSciNet  MATH  Google Scholar 

  • Klingman D, Napier A, Stutz J (1974) A program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems. Manage Sci 20(5):814–821

    Article  MATH  Google Scholar 

  • Krishnamoorthy M, Ernst AT, Sharaiha YM (2001) Comparison of algorithms for the degree constrained minimum spanning tree. J Heuristics 7(6):587–611

    Article  MATH  Google Scholar 

  • Kruskal JB (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc 7(1):48–50

    Article  MathSciNet  MATH  Google Scholar 

  • Makhorin A (2009), GNU Linear Programming Kit (GLPK) v 4.38, gnu project Edition

  • Molnar M (2008a) Hierarchies for constrained partial spanning problems in graphs, Technical report PI-1900

  • Molnar M (2008b) Hierarchies to solve constrained spanning problem, Private communication

  • Molnar M, Durand S, Merabet M (2014) Approximation of the degree-constrained minimum spanning hierarchies. In: Halldorsson MM (ed) Structural information and communication complexity: 21st international colloquium, SIROCCO 2014, Takayama, Japan. Proceedings, Springer International Publishing, pp 96–107. doi:10.1007/978-3-319-09620-9

  • Obruca AK (1968) Spanning tree manipulation and the travelling salesman problem. Comput J 10(4):374–377

    Article  Google Scholar 

  • Orloff CS (1974) A fundamental problem in vehicle routing. Networks 4(1):35–64. doi:10.1002/net.3230040105

    Article  MathSciNet  MATH  Google Scholar 

  • Polzin T, Daneshmand SV (2001) A comparison of Steiner tree relaxations. Discrete Appl Math 112(1):241–261 (combinatorial optimization symposium, selected papers)

    Article  MathSciNet  MATH  Google Scholar 

  • Ravi R, Marathe MV, Ravi SS, Rosenkrantz DJ, Hunt III HB (1993) Many birds with one stone: multi-objective approximation algorithms. In: Proceedings of the twenty-fifth annual ACM symposium on theory of computing, STOC ’93, ACM, New York, pp 438–447

  • Ravi R, Marathe M, Ravi S et al (2001) Approximation algorithms for degree-constrained minimum-cost network-design problems. Algorithmica 31:58

  • Singh M, Lau LC (2007) Approximating minimum bounded degree spanning trees to within one of optimal. In: Proceedings of the thirty-ninth annual ACM symposium on theory of computing, STOC ’07, ACM, New York, pp 661–670

  • Singh M, Zenklusen R (2016) k-trails: Recognition, complexity, and approximations. In: Louveaux Q, Skutella M (eds) Integer programming and combinatorial optimization: 18th international conference, IPCO 2016, Liège, Belgium, 1–3 June 2016, Proceedings, Springer International Publishing, Cham, pp 114–125. doi:10.1007/978-3-319-33461-510

  • Uchoa E, Fukasawa R, Lysgaard J, Pessoa A, de Aragão MP, Andrade D (2008) Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation. Math Programm 112(2):443–472. doi:10.1007/s10107-006-0043-y

    Article  MathSciNet  MATH  Google Scholar 

  • Zhou F, Molnar M, Cousin B (2010) Light-hierarchy: the optimal structure for multicast routing in wdm mesh networks. In: ISCC, pp 611–616

Download references

Author information

Authors and Affiliations

  1. ERIAN, Nanyang Technological University, Singapore, Singapore

    Massinissa Merabet

  2. LIRMM, University of Montpellier, Montpellier, France

    Miklos Molnar

  3. LIRMM, University Paul Valéry Montpellier 3, Montpellier, France

    Sylvain Durand

Authors
  1. Massinissa Merabet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miklos Molnar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sylvain Durand
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Massinissa Merabet.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Merabet, M., Molnar, M. & Durand, S. ILP formulation of the degree-constrained minimum spanning hierarchy problem. J Comb Optim 36, 789–811 (2018). https://doi.org/10.1007/s10878-017-0159-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-017-0159-4

Keywords

Search

Navigation