Sciweavers

1671 search results - page 14 / 335
» On the Covering Steiner Problem
Sort
View
AAAI
2011
12 years 9 months ago
The Steiner Multigraph Problem: Wildlife Corridor Design for Multiple Species
The conservation of wildlife corridors between existing habitat preserves is important for combating the effects of habitat loss and fragmentation facing species of concern. We in...
Katherine J. Lai, Carla P. Gomes, Michael K. Schwa...
WADS
2005
Springer
122views Algorithms» more  WADS 2005»
14 years 3 months ago
Parameterized Complexity of Generalized Vertex Cover Problems
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
EOR
2008
107views more  EOR 2008»
13 years 10 months ago
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
Alysson M. Costa, Jean-François Cordeau, Gi...
TVLSI
2002
82views more  TVLSI 2002»
13 years 9 months ago
Probability-based approach to rectilinear Steiner tree problems
Abstract--The rectilinear Steiner tree (RST) problem is of essential importance to the automatic interconnect optimization for VLSI design. In this paper, we present a class of pro...
Chunhong Chen, Jiang Zhao, Majid Ahmadi
COCOA
2008
Springer
13 years 11 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner