Sciweavers

632 search results - page 49 / 127
» On the Approximability of the Steiner Tree Problem
Sort
View
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
14 years 3 months ago
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
Ilias Diakonikolas, Mihalis Yannakakis
DAM
2006
191views more  DAM 2006»
13 years 8 months ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart
MP
2006
90views more  MP 2006»
13 years 8 months ago
Solving multistage asset investment problems by the sample average approximation method
The vast size of real world stochastic programming instances requires sampling to make them practically solvable. In this paper we extend the understanding of how sampling affects ...
Jörgen Blomvall, Alexander Shapiro
LION
2009
Springer
145views Optimization» more  LION 2009»
14 years 3 months ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall
ALGOSENSORS
2009
Springer
14 years 3 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal