Lower Bounds from Tile Covers for the Channel Assignment Problem

Authors:
J. C. M. Janssen;T. E. Wentzell;S. L. Fitzpatrick
Affiliations:
-;-;-
Venue:
SIAM Journal on Discrete Mathematics
Year:
2005

Citing 0
Cited 1

Stochastic Local Search Algorithms for Graph Set T-colouring and Frequency Assignment

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices induces an edge. Questions of this type are motivated by problems ...