Sciweavers

2636 search results - page 345 / 528
» Linear Programming
Sort
View
153
Voted
SODA
2003
ACM
133views Algorithms» more  SODA 2003»
15 years 5 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...
120
Voted
SODA
2000
ACM
122views Algorithms» more  SODA 2000»
15 years 5 months ago
Cooperative facility location games
The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cos...
Michel X. Goemans, Martin Skutella
142
Voted
TSMC
2002
100views more  TSMC 2002»
15 years 3 months ago
A LP-RR principle-based admission control for a mobile network
Abstract--In mobile networks, the traffic fluctuation is unpredictable due to mobility and varying resource requirement of multimedia applications. Hence, it is essential to mainta...
B. P. Vijay Kumar, P. Venkataram
149
Voted
OSN
2007
185views more  OSN 2007»
15 years 3 months ago
Comparison of ILP formulations for the RWA problem
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
Brigitte Jaumard, Christophe Meyer, B. Thiongane
146
Voted
ICCAD
2009
IEEE
131views Hardware» more  ICCAD 2009»
15 years 1 months ago
Scheduling with soft constraints
In a behavioral synthesis system, a typical approach used to guide the scheduler is to impose hard constraints on the relative timing between operations considering performance, a...
Jason Cong, Bin Liu, Zhiru Zhang