This article explores the development of previous models to determine hubs in a competitive environment. In this paper, by comparing parameters of the ticket price, travel time and the service quality of hub airports, airline hubs are divided into six categories. The degree of importance of travel time and travel cost are determined by a multivariate Lagrange interpolation method, which can pla...

Resting-state functional MRI (R-fMRI) has emerged as a promising neuroimaging technique used to identify global hubs of the human brain functional connectome. However, most R-fMRI studies on functional hubs mainly utilize traditional R-fMRI data with relatively low sampling rates (e.g., repetition time [TR]=2 s). R-fMRI data scanned with higher sampling rates are important for the characterizat...

Highly connected nodes (hubs) in biological networks are topologically important to the structure of the network and have also been shown to be preferentially associated with a range of phenotypes of interest. The relative importance of a hub node, however, can change depending on the biological context. Here, we report a Cytoscape app, the Contextual Hub Analysis Tool (CHAT), which enables use...

Recently, Chakrabarty et al. [5] initiated a systematic study of capacitated set cover problems, and considered the question of how their approximability relates to that of the uncapacitated problem on the same underlying set system. Here, we investigate this connection further and give several results, both positive and negative. In particular, we show that if the underlying set system satisfi...

It is well known that choosing a good formulation for a mixed-integer optimization model can drastically reduce its solution time with a linear-programming based branch-and-bound algorithm. Integer optimization software such as CPLEX and XPRESS-MP has progressed rapidly in recent years and implements powerful branchand-cut algorithms, combining branch-and-bound with cutting plane generation. In...

The famous Padberg–Rao separation algorithm for b-matching polyhedra can be implemented to run in O(|V |2|E| log(|V |2/|E|)) time in the uncapacitated case, and in O(|V ||E|2 log (|V |2/|E|)) time in the capacitated case. We give a new and simple algorithm for the capacitated case which can be implemented to run in O(|V |2|E| log(|V |2/|E|)) time.

The protein-protein interaction (PPI) networks are dynamically organized as modules, and are typically described by hub dichotomy: 'party' hubs act as intramodule hubs and are coexpressed with their partners, yet 'date' hubs act as coordinators among modules and are incoherently expressed with their partners. However, there remains skepticism about the existence of hub dichotomy. Since differen...

Uncovering interactions between genes, gene networks, is important to increase our understanding of intrinsic cellular processes and responses to external stimuli such as drugs. Gene networks can be computationally inferred from repeated measurements of gene expression, using algorithms, which assume that each gene is controlled by only a small number of other proteins. Here, by extending the t...