Better bounds for incremental frequency allocation in bipartite graphs
نویسندگان
چکیده
منابع مشابه
Better Bounds for Incremental Frequency Allocation in Bipartite Graphs
We study frequency allocation in wireless networks. A wireless network is modeled by an undirected graph, with vertices corresponding to cells. In each vertex we have a certain number of requests, and each of those requests must be assigned a different frequency. Edges represent conflicts between cells, meaning that frequencies in adjacent vertices must be different as well. The objective is to...
متن کاملBetter Bounds for Incremental Medians
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contains at most k facilities. We say that this incremental medians sequence is R-competitive if the cost of each Fk is at most R times the optimum cost of k facilities. The smallest such R is called the competitive ratio of the se...
متن کاملBetter Bounds for k-Partitions of Graphs
Combinatorics, Probability and Computing / Volume 20 / Issue 04 / July 2011, pp 631 640 DOI: 10.1017/S0963548311000204, Published online: 31 May 2011 Link to this article: http://journals.cambridge.org/abstract_S0963548311000204 How to cite this article: BAOGANG XU and XINGXING YU (2011). Better Bounds for k-Partitions of Graphs. Combinatorics, Probability and Computing, 20, pp 631-640 doi:10.1...
متن کاملUpper and lower bounds for the energy of bipartite graphs
Using Lagrange’s multiplier rule, we find upper and lower bounds of the energy of a bipartite graph G, in terms of the number of vertices, edges and the spectral moment of fourth order. Moreover, the upper bound is attained in a graph G if and only if G is the graph of a symmetric balanced incomplete block design (BIBD). Also, we determine the graphs for which the lower bound is sharp. 2003 E...
متن کاملBounds for the Kirchhoff Index of Bipartite Graphs
A m,n -bipartite graph is a bipartite graph such that one bipartition has m vertices and the other bipartition has n vertices. The tree dumbbell D n, a, b consists of the path Pn−a−b together with a independent vertices adjacent to one pendent vertex of Pn−a−b and b independent vertices adjacent to the other pendent vertex of Pn−a−b. In this paper, firstly, we show that, among m,n bipartite gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.05.020