Sciweavers

438 search results - page 26 / 88
» The forest hiding problem
Sort
View
NETWORKS
2010
14 years 10 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
IPCO
2010
148views Optimization» more  IPCO 2010»
15 years 1 months ago
Prize-Collecting Steiner Network Problems
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
CCCG
2009
15 years 28 days ago
Inapproximability of the Perimeter Defense Problem
We model the problem of detecting intruders using a set of infrared beams by the perimeter defense problem: given a polygon P, find a minimum set of edges S of the polygon such th...
Evangelos Kranakis, Danny Krizanc, Lata Narayanan,...
ICCS
2003
Springer
15 years 5 months ago
A Problem Solving Environment for Modelling Stony Coral Morphogenesis
Abstract. Apart from experimental and theoretical approaches, computer simulation is an important tool in testing hypotheses about stony coral growth. However, the construction and...
Roeland Merks, Alfons G. Hoekstra, Jaap A. Kaandor...
WSCG
2000
117views more  WSCG 2000»
15 years 1 months ago
Solving Multiple Layer Containment Problems Using Iterative Methods
The footwear industry's need for an automatic containment algorithm is becoming increasingly important within the manufacturing process. Irregular containers, such as hides, ...
Nuno Marques, Pedro Capela, João Bernardo