Channel Assignment with Large Demands.

Channel Assignment with Large Demands.

We introduce a general static model for radio channel assignment, the 'feasible assignments model', in which to investigate the effects of changes in demand. For a fixed instance of this model where only the demands can vary, we consider the span of spectrum needed for a feasible assignmen...

Szczegółowa specyfikacja

Opis bibliograficzny
Główni autorzy:	Gerke, S, McDiarmid, C
Format:	Journal article
Język:	English
Wydane:	2001

Podobne zapisy

Random channel assignment in the plane.
od: McDiarmid, C
Wydane: (2003)

On The Span Of A Random Channel Assignment Problem.
od: McDiarmid, C
Wydane: (2007)

A doubly cyclic channel assignment problem
od: McDiarmid, C
Wydane: (1997)

Channel assignment and weighted coloring.
od: McDiarmid, C, i wsp.
Wydane: (2000)

On the span in channel assignment problems: Bounds, computing and counting
od: McDiarmid, C
Wydane: (2003)

On the span in channel assignment problems: bounds, computing and counting
od: McDiarmid, C
Wydane: (2003)

Channel assignment on graphs of bounded treewidth.
od: McDiarmid, C, i wsp.
Wydane: (2003)

Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs.
od: McDiarmid, C, i wsp.
Wydane: (2001)

Graph Imperfection.
od: Gerke, S, i wsp.
Wydane: (2001)

Graph Imperfection II.
od: Gerke, S, i wsp.
Wydane: (2001)

On the Number of Edges in Random Planar Graphs.
od: Gerke, S, i wsp.
Wydane: (2004)

Graph Imperfection with a Co-Site Constraint.
od: Gerke, S, i wsp.
Wydane: (2004)

Quicksort and Large Deviations.
od: McDiarmid, C
Wydane: (2012)

Frequency-distance constraints with large distances
od: McDiarmid, C
Wydane: (2000)

Random planar graphs with n nodes and a fixed number of edges.
od: Gerke, S, i wsp.
Wydane: (2005)

Connectivity for random graphs from a weighted bridge-addable class
od: McDiarmid, C
Wydane: (2012)

Hypergraph colouring and the Lovász Local Lemma
od: McDiarmid, C
Wydane: (1997)

Random Graphs from a Minor-Closed Class.
od: McDiarmid, C
Wydane: (2009)

Random graphs on surfaces.
od: McDiarmid, C
Wydane: (2008)

Concentration For Independent Permutations.
od: McDiarmid, C
Wydane: (2002)

Random graphs from a weighted minor-closed class
od: McDiarmid, C
Wydane: (2012)

On graphs with few disjoint t-star minors.
od: McDiarmid, C
Wydane: (2011)

Connectivity for bridge-alterable graph classes
od: McDiarmid, C
Wydane: (2013)

Advocating for the Health Worker
od: Melissa McDiarmid
Wydane: (2019-01-01)

The number of disk graphs
od: McDiarmid, C, i wsp.
Wydane: (2014)

The Number of Bits Needed to Represent a Unit Disk Graph.
od: McDiarmid, C, i wsp.
Wydane: (2010)

On the chromatic number of random geometric graphs
od: McDiarmid, C, i wsp.
Wydane: (2011)

Integer realizations of disk and segment graphs
od: McDiarmid, C, i wsp.
Wydane: (2011)

Counting disk graphs.
od: McDiarmid, C, i wsp.
Wydane: (2011)

The number of disk graphs.
od: McDiarmid, C, i wsp.
Wydane: (2014)

Integer realizations of disk and segment graphs
od: McDiarmid, C, i wsp.
Wydane: (2011)

On the chromatic number of random geometric graphs
od: McDiarmid, C, i wsp.
Wydane: (2011)

On the divisibility of graphs
od: Hoang, C, i wsp.
Wydane: (2002)

Competing Theories for Improving Teacher Preparation Programs: The Case of North Carolina
od: G. Williamson McDiarmid
Wydane: (2019-06-01)

Innovations and Collaboration to Influence Policy and Practice: Global Deans Speak
od: G. Williamson McDiarmid
Wydane: (2020-09-01)

Hazards of the Health Care Sector: Looking Beyond Infectious Disease
od: Melissa A. McDiarmid
Wydane: (2014-11-01)

Bisecting sparse random graphs.
od: Luczak, M, i wsp.
Wydane: (2001)

On the maximum queue length in the supermarket model
od: Luczak, M, i wsp.
Wydane: (2006)

On the Maximum Degree of a Random Planar Graph.
od: McDiarmid, C, i wsp.
Wydane: (2008)

Concentration for self-bounding functions and an inequality of Talagrand.
od: McDiarmid, C, i wsp.
Wydane: (2006)