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 do periódico: 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: 18 abr. 2024. -
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 2024 abr. 18 ] 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 2024 abr. 18 ] Available from: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf - Um algoritmo híbrido para o problema de corte unidimensional
- Contribuições a teoria dos grafos e otimização combinatória
- Two-and three-dimensional parametric packing
- Composition of facets of the clique partitioning polytope
- On the circuit cover problem for mixed graphs
- Near-optimum universal graphs for graphs with bounded degrees
- The maximum agreement forest problem: approximation algorithms and computational experiments
- Tree 3-spanners on generalized prisms of graphs
- Covering a graph with nontrivial vertex-disjoint paths: existence and optimization
- Sobre grafos hamiltonianos
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
