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...

Бүрэн тодорхойлолт

Номзүйн дэлгэрэнгүй
Үндсэн зохиолчид:	Gerke, S, McDiarmid, C
Формат:	Journal article
Хэл сонгох:	English
Хэвлэсэн:	2001

Ижил төстэй зүйлс

Random channel assignment in the plane.
-н: McDiarmid, C
Хэвлэсэн: (2003)

On The Span Of A Random Channel Assignment Problem.
-н: McDiarmid, C
Хэвлэсэн: (2007)

A doubly cyclic channel assignment problem
-н: McDiarmid, C
Хэвлэсэн: (1997)

Channel assignment and weighted coloring.
-н: McDiarmid, C, зэрэг
Хэвлэсэн: (2000)

On the span in channel assignment problems: Bounds, computing and counting
-н: McDiarmid, C
Хэвлэсэн: (2003)

On the span in channel assignment problems: bounds, computing and counting
-н: McDiarmid, C
Хэвлэсэн: (2003)

Channel assignment on graphs of bounded treewidth.
-н: McDiarmid, C, зэрэг
Хэвлэсэн: (2003)

Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs.
-н: McDiarmid, C, зэрэг
Хэвлэсэн: (2001)

Graph Imperfection.
-н: Gerke, S, зэрэг
Хэвлэсэн: (2001)

Graph Imperfection II.
-н: Gerke, S, зэрэг
Хэвлэсэн: (2001)

On the Number of Edges in Random Planar Graphs.
-н: Gerke, S, зэрэг
Хэвлэсэн: (2004)

Graph Imperfection with a Co-Site Constraint.
-н: Gerke, S, зэрэг
Хэвлэсэн: (2004)

Quicksort and Large Deviations.
-н: McDiarmid, C
Хэвлэсэн: (2012)

Frequency-distance constraints with large distances
-н: McDiarmid, C
Хэвлэсэн: (2000)

Random planar graphs with n nodes and a fixed number of edges.
-н: Gerke, S, зэрэг
Хэвлэсэн: (2005)

Connectivity for random graphs from a weighted bridge-addable class
-н: McDiarmid, C
Хэвлэсэн: (2012)

Hypergraph colouring and the Lovász Local Lemma
-н: McDiarmid, C
Хэвлэсэн: (1997)

Random Graphs from a Minor-Closed Class.
-н: McDiarmid, C
Хэвлэсэн: (2009)

Random graphs on surfaces.
-н: McDiarmid, C
Хэвлэсэн: (2008)

Concentration For Independent Permutations.
-н: McDiarmid, C
Хэвлэсэн: (2002)

Random graphs from a weighted minor-closed class
-н: McDiarmid, C
Хэвлэсэн: (2012)

On graphs with few disjoint t-star minors.
-н: McDiarmid, C
Хэвлэсэн: (2011)

Connectivity for bridge-alterable graph classes
-н: McDiarmid, C
Хэвлэсэн: (2013)

Advocating for the Health Worker
-н: Melissa McDiarmid
Хэвлэсэн: (2019-01-01)

The number of disk graphs
-н: McDiarmid, C, зэрэг
Хэвлэсэн: (2014)

The Number of Bits Needed to Represent a Unit Disk Graph.
-н: McDiarmid, C, зэрэг
Хэвлэсэн: (2010)

On the chromatic number of random geometric graphs
-н: McDiarmid, C, зэрэг
Хэвлэсэн: (2011)

Integer realizations of disk and segment graphs
-н: McDiarmid, C, зэрэг
Хэвлэсэн: (2011)

Counting disk graphs.
-н: McDiarmid, C, зэрэг
Хэвлэсэн: (2011)

The number of disk graphs.
-н: McDiarmid, C, зэрэг
Хэвлэсэн: (2014)

Integer realizations of disk and segment graphs
-н: McDiarmid, C, зэрэг
Хэвлэсэн: (2011)

On the chromatic number of random geometric graphs
-н: McDiarmid, C, зэрэг
Хэвлэсэн: (2011)

On the divisibility of graphs
-н: Hoang, C, зэрэг
Хэвлэсэн: (2002)

Competing Theories for Improving Teacher Preparation Programs: The Case of North Carolina
-н: G. Williamson McDiarmid
Хэвлэсэн: (2019-06-01)

Innovations and Collaboration to Influence Policy and Practice: Global Deans Speak
-н: G. Williamson McDiarmid
Хэвлэсэн: (2020-09-01)

Hazards of the Health Care Sector: Looking Beyond Infectious Disease
-н: Melissa A. McDiarmid
Хэвлэсэн: (2014-11-01)

Bisecting sparse random graphs.
-н: Luczak, M, зэрэг
Хэвлэсэн: (2001)

On the maximum queue length in the supermarket model
-н: Luczak, M, зэрэг
Хэвлэсэн: (2006)

On the Maximum Degree of a Random Planar Graph.
-н: McDiarmid, C, зэрэг
Хэвлэсэн: (2008)

Concentration for self-bounding functions and an inequality of Talagrand.
-н: McDiarmid, C, зэрэг
Хэвлэсэн: (2006)