# Efficient Algorithms for Airline Problem

## Abstract

The airlines in the real world form small-world network. This implies that they are constructed with an ad hoc strategy. The small-world network is not so bad from the viewpoints of customers and managers. The customers can fly to any destination through a few airline hubs, and the number of airlines is not so many comparing to the number of airports. However, clearly, it is not the best solution in either viewpoint since there is a trade off. In this paper, one of the extreme cases, which is the standpoint of the manager, is considered; we assume that customers are silent and they never complain even if they are required to transit many times. This assumption is appropriate for some transportation service and packet communication. Under this assumption, the airline problem is to construct the least cost connected network for given distribution of the populations of cities with no a priori connection. First, we show an efficient algorithm that produces a good network which is minimized the number of vacant seats. The resultant network contains at most *n* connections (or edges), where *n* is the number of cities. Next we aim to minimize not only the number of vacant seats, but also the number of airline connections. The connected network with the least number of edges is a tree which has exactly *n* − 1 connections. However, the problem to construct a tree airline network with the minimum number of vacant seats is \({\cal NP}\)-complete. We also propose efficient approximation algorithms to construct a tree airline network with the minimum number of vacant seats.

## Keywords

Airline problem approximation algorithm efficient algorithm \({\cal NP}\)-completeness## Preview

Unable to display preview. Download preview PDF.

## References

- 1.Amaral, L.A.N., et al.: Classes of small-world networks. Applied Physical Science 97(21), 11149–11152 (2000)Google Scholar
- 2.Barabasi, A.L.: Linked: The New Science of Networks. Perseus Books Group, Reading (2002)Google Scholar
- 3.Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. McGraw-Hill, New York (1990)Google Scholar
- 4.Garey, M.R., Johnson, D.S.: Computers and Intractability — A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)zbMATHGoogle Scholar
- 5.Newman, M.: The structure and function of complex networks. SIAM Review 45, 167–256 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
- 6.O’Kelly, M.: A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research 32, 393–404 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
- 7.Sohn, J., Park, S.: The Single Allocation Problem in the Interacting Three-Hub Network. Networks 35, 17–25 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
- 8.Watts, D.J.: Small Worlds: The Dynamics of Networks Between Order and Randomness. Princeton University Press, Princeton (2004)zbMATHGoogle Scholar