A Tight Worst Case Bound for the Performance Ratio of Heuristics for the Minimum Rectilinear Steiner Tree Problem

Título:

A Tight Worst Case Bound for the Performance Ratio of Heuristics for the Minimum Rectilinear Steiner Tree Problem

Autor:

Celso da Cruz Carneiro Ribeiro

Ano:

1990

Revista:

ISSN:

01716468

Tags:

Problema de Steiner

Idioma:

Inglês

Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

Edge Coloring: A Natural Model for Sports Scheduling

A multistart constructive heuristic for sequencing by hybridization using adaptive memory

Solving diameter constrained minimum spanning trees in dense graphs

A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications

A Parallel GRASP Heuristic for the 2-Path Network Design Problem

Performance Evaluation of a Parallel Tabu Search Task Scheduling Algorithm

A randomized heuristic for scene recognition by graph matching

Metaheuristics for optimization problems in computer communications

New Efficient Heuristics for the Minimum Rectilinear Steiner Tree Problem

Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem