Sciweavers

1404 search results - page 238 / 281
» Optimization problems in multiple-interval graphs
Sort
View
GECCO
2005
Springer
130views Optimization» more  GECCO 2005»
15 years 3 months ago
ATNoSFERES revisited
ATNoSFERES is a Pittsburgh style Learning Classifier System (LCS) in which the rules are represented as edges of an Augmented Transition Network. Genotypes are strings of tokens ...
Samuel Landau, Olivier Sigaud, Marc Schoenauer
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
14 years 11 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
ICALP
2005
Springer
15 years 3 months ago
Stochastic Steiner Trees Without a Root
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
Anupam Gupta, Martin Pál
91
Voted
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
14 years 11 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
101
Voted
SODA
2003
ACM
133views Algorithms» more  SODA 2003»
14 years 11 months ago
Integrality ratio for group Steiner trees and directed steiner trees
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
Eran Halperin, Guy Kortsarz, Robert Krauthgamer, A...