Conference
Channel assignment on graphs of bounded treewidth.
- Abstract:
-
The following 'constraint matrix span problem' arises in the assignment of radio channels in cellular communications systems. Given a graph G with a positive integer length l(xy) for each edge xy, and given a positive integer B, can we assign to each vertex x a channel φ(x) from 1,...,B such that |φ(x) - φ(y)|≥l(xy) for each edge xy? We show that this problem is NP-complete for graphs of treewidth at most 3, but there is a fully polynomial time approximation scheme for the problem on graphs o...
Expand abstract
- Publication status:
- Published
Actions
Access Document
- Publisher copy:
- 10.1016/S0012-365X(03)00236-X
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- Volume:
- 273
- Issue:
- 1-3
- Pages:
- 183-192
- Publication date:
- 2003-01-01
- DOI:
- ISSN:
-
0012-365X
- URN:
-
uuid:9793acba-8dbe-4042-ba68-ecd5c6197f96
- Source identifiers:
-
102297
- Local pid:
- pubs:102297
Item Description
Terms of use
- Copyright date:
- 2003
If you are the owner of this record, you can report an update to it here: Report update to this record