Combinatorial equivalence of Chromatic Scheduling Polytopes

Mostrar otras versiones (1)

Point-to-Multipoint systems are one kind of radio systems supplying wireless access to voice/data communication networks. Capacity constraints typically force the reuse of frequencies but, on the other hand, no interference must be caused thereby. This leads to the bandwidth allocation problem, a sp...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Marenco, J.
Otros Autores: Wagler, A.
Formato: Capítulo de libro
Lenguaje:Inglés
Publicado: 2004
Acceso en línea:Registro en Scopus
DOI
Handle
Registro en la Biblioteca Digital
Aporte de:Registro referencial: Solicitar el recurso aquí
Biblioteca Central Dr. Luis F. Leloir (FCEN) de Universidad de Buenos Aires
LEADER 03397caa a22004097a 4500
001 PAPER-4333
003 AR-BaUEN
005 20230518203352.0
008 190411s2004 xx ||||fo|||| 00| 0 eng|d
024 7 |2 scopus  |a 2-s2.0-34247345803 
040 |a Scopus  |b spa  |c AR-BaUEN  |d AR-BaUEN 
100 1 |a Marenco, J. 
245 1 0 |a Combinatorial equivalence of Chromatic Scheduling Polytopes 
260 |c 2004 
270 1 0 |m Marenco, J.; Departamento de Computación, FCEN, Universidad de Buenos Aires, Pabellón I, (1428) Buenos Aires, Argentina; email: jmarenco@dc.uba.ar 
506 |2 openaire  |e Política editorial 
504 |a de Werra, D., Gay, Y., Chromatic scheduling and frequency assignment (1994) Discrete Appl. Math., 49, pp. 165-174 
504 |a de Werra, D., Hertz, A., Consecutive colorings of graphs (1988) ZOR, 32, pp. 1-8 
504 |a Kubale, M., Interval vertex-coloring of a graph with forbidden colors (1989) Discrete Math., 74, pp. 125-136; 
520 3 |a Point-to-Multipoint systems are one kind of radio systems supplying wireless access to voice/data communication networks. Capacity constraints typically force the reuse of frequencies but, on the other hand, no interference must be caused thereby. This leads to the bandwidth allocation problem, a special case of so-called chromatic scheduling problems. Both problems are NP-Hard, and there exist no polynomial time algorithms with a guaranteed quality. In order to apply cutting plane methods to this problem, the associated chromatic scheduling polytopes must be studied. These polytopes have interesting theoretical properties. In this work, we present a characterization of the extreme points of chromatic scheduling polytopes, which enables to prove combinatorial equivalence properties. © 2005 Elsevier B.V. All rights reserved.  |l eng 
536 |a Detalles de la financiación: Secretaría de Ciencia y Técnica, Universidad de Buenos Aires, 644/98, X036 
536 |a Detalles de la financiación: Agencia Nacional de Promoción Científica y Tecnológica, 11-09112 
536 |a Detalles de la financiación: Email: jmarenco@dc.uba.ar . Partially supported by Ubacyt Grant X036, Conicet Grant 644/98 and Anpcyt Grant 11-09112. 2 Email: wagler@zib.de 
593 |a Departamento de Computación, FCEN, Universidad de Buenos Aires, Pabellón I, (1428) Buenos Aires, Argentina 
593 |a Konrad-Zuse-Zentrum für Informationstechik Berlin, Takustr. 7, 14195 Berlin, Germany 
690 1 0 |a COMBINATORIAL EQUIVALENCE 
690 1 0 |a POLYHEDRAL COMBINATORICS 
700 1 |a Wagler, A. 
773 0 |d 2004  |g v. 18  |h pp. 177-180  |p Electron. Notes Discrete Math.  |x 15710653  |t Electronic Notes in Discrete Mathematics 
856 4 1 |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-34247345803&doi=10.1016%2fj.endm.2004.06.028&partnerID=40&md5=fbfcdfe313b38ac7a09deffe37025792  |y Registro en Scopus 
856 4 0 |u https://doi.org/10.1016/j.endm.2004.06.028  |y DOI 
856 4 0 |u https://hdl.handle.net/20.500.12110/paper_15710653_v18_n_p177_Marenco  |y Handle 
856 4 0 |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710653_v18_n_p177_Marenco  |y Registro en la Biblioteca Digital 
961 |a paper_15710653_v18_n_p177_Marenco  |b paper  |c PE 
962 |a info:eu-repo/semantics/article  |a info:ar-repo/semantics/artículo  |b info:eu-repo/semantics/publishedVersion 
963 |a VARI 
999 |c 65286 

Ejemplares similares