Sciweavers

107 search results - page 5 / 22
» Prize-Collecting Steiner Network Problems
Sort
View
SIAMCOMP
2008
104views more  SIAMCOMP 2008»
13 years 7 months ago
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
Jochen Könemann, Stefano Leonardi, Guido Sch&...
FOCS
2009
IEEE
14 years 2 months ago
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
Zeev Nutov
AAAI
2011
12 years 7 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...
DAC
2006
ACM
14 years 8 months ago
Circuit simulation based obstacle-aware Steiner routing
Steiner routing is a fundamental yet NP-hard problem in VLSI design and other research fields. In this paper, we propose to model the routing graph by an RC network with routing t...
Yiyu Shi, Paul Mesa, Hao Yu, Lei He
ALGORITHMICA
2005
99views more  ALGORITHMICA 2005»
13 years 7 months ago
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
Marek Karpinski, Ion I. Mandoiu, Alexander Olshevs...