Polyhedral and computational results on the k-hop connected dominating set problem (2015)
- Authors:
- Autor USP: WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- Subjects: COMBINATÓRIA; TEORIA DOS GRAFOS; ALGORITMOS
- Language: Inglês
- Imprenta:
- Publisher: Mathematical Optimization Society
- Publisher place: Philadelphia
- Date published: 2015
- Source:
- Título: Book of abstracts
- Conference titles: International Symposium on Mathematical Programming (ISMP 2015)
-
ABNT
MOURA, Phablo Fernando Soares e COELHO, Rafael Santos e WAKABAYASHI, Yoshiko. Polyhedral and computational results on the k-hop connected dominating set problem. 2015, Anais.. Philadelphia: Mathematical Optimization Society, 2015. Disponível em: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf. Acesso em: 23 jan. 2026. -
APA
Moura, P. F. S., Coelho, R. S., & Wakabayashi, Y. (2015). Polyhedral and computational results on the k-hop connected dominating set problem. In Book of abstracts. Philadelphia: Mathematical Optimization Society. Recuperado de http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf -
NLM
Moura PFS, Coelho RS, Wakabayashi Y. Polyhedral and computational results on the k-hop connected dominating set problem [Internet]. Book of abstracts. 2015 ;[citado 2026 jan. 23 ] Available from: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf -
Vancouver
Moura PFS, Coelho RS, Wakabayashi Y. Polyhedral and computational results on the k-hop connected dominating set problem [Internet]. Book of abstracts. 2015 ;[citado 2026 jan. 23 ] Available from: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf - On the structure of the monotone asymmetric travelling salesman polytope II: hypotraceable facets
- A note on the approximability of cutting stock problems
- On dominating sets of maximal outerplanar graphs
- The complexity of computing medians of relations
- Polynomial-time approximation schemes for circle packing problems
- Selfish 2D bin packing game
- Packing entering sets in kernel systems
- Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds
- Hypotraceable digraphs
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
