Spanning trees with generalized degree constraints arising in the design of wireless networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6701 LNCS, Issue , 2011, Pages 77-82

  Gouveia, Luís ^a   Moura, Pedro ^a   De Sousa, Amaro ^b  

^a UNIVERSITY OF LISBON   (Portugal)

^b UNIVERSITY OF AVEIRO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

DEGREE CONSTRAINTS; EXTENDED VERSIONS; LINEAR PROGRAMMING RELAXATION; MINIMUM SPANNING TREE PROBLEM; SIGNAL STRENGTHS; SPANNING TREE; TRANSMITTER AND RECEIVER; WIRELESS LINK;

LINEAR PROGRAMMING; OPTIMIZATION; PLANT EXTRACTS; SIGNAL RECEIVERS;

SIGNAL RECEIVERS; WIRELESS NETWORKS;

EID: 80053032962     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21527-8_10     Document Type: Conference Paper

References (5)

1. Cunha, A., Lucena, A.: Lower and upper bounds for the Degree-constrained Minimum Spanning Tree Problem. Networks 50(1), 55-66 (2007)
2. Duhamel, C., Gouveia, L., Moura, P., Souza, M.: Models and Heuristics for the k-degree constrained minimum spanning tree problem with node-degree costs. To appear in Networks (2011)
3. Gouveia, L., Moura, P.: Spanning Trees with Node Degree Dependent Costs and Knapsack Reformulations. Electronic Notes in Discrete Mathematics 36, 985-992 (2010)
4. Gouveia, L., Moura, P., Sousa, A.: Prize collecting Steiner trees with node degree dependent costs. Computers & Operations Research 38(1), 234-245 (2010)
5. Magnanti, T., Wolsey, L.: Optimal Trees. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Handbooks in Operational Research and Management Science (1995)