IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v107y2001i1p143-15910.1023-a1014951015725.html
   My bibliography  Save this article

Channel Assignment with Large Demands

Author

Listed:
  • Stefanie Gerke
  • Colin McDiarmid

Abstract

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 assignment of channels to transmitters, and compare this span with a collection of lower bounds, in the limit when demands at the transmitters get large. We introduce a relevant measure which generalises the imperfection ratio of a graph and give alternative descriptions. We show that for a fixed instance of the feasible assignments model where only the demands can vary, on input the demands we can find the span in polynomial time. For the special case when the feasible assignments can be described by means of a complete graph together with co-site and adjacent constraints, we give a formula for the span. This yields clique-based lower bounds for the span in general problems. Copyright Kluwer Academic Publishers 2001

Suggested Citation

  • Stefanie Gerke & Colin McDiarmid, 2001. "Channel Assignment with Large Demands," Annals of Operations Research, Springer, vol. 107(1), pages 143-159, October.
    • Handle: RePEc:spr:annopr:v:107:y:2001:i:1:p:143-159:10.1023/a:1014951015725
    DOI: 10.1023/A:1014951015725
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1014951015725
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1014951015725?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:107:y:2001:i:1:p:143-159:10.1023/a:1014951015725. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.