Sciweavers

3250 search results - page 43 / 650
» An Algorithm to Solve a Linear Program
Sort
View
MP
1998
83views more  MP 1998»
13 years 8 months ago
A modified layered-step interior-point algorithm for linear programming
The layered-step interior-point algorithm was introduced by Vavasis and Ye. The algorithm accelerates the path following interior-point algorithm and its arithmetic complexity dep...
Nimrod Megiddo, Shinji Mizuno, Takashi Tsuchiya
DAC
2007
ACM
14 years 9 months ago
An Integer Linear Programming Based Routing Algorithm for Flip-Chip Design
The flip-chip package provides a high chip-density solution to the demand for more I/O pads of VLSI designs. In this paper, we present the first routing algorithm in the literatur...
Jia-Wei Fang, Chin-Hsiung Hsu, Yao-Wen Chang
SPAA
2009
ACM
14 years 9 months ago
An optimal local approximation algorithm for max-min linear programs
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
Patrik Floréen, Joel Kaasinen, Petteri Kask...
SODA
2008
ACM
71views Algorithms» more  SODA 2008»
13 years 10 months ago
Two-phase greedy algorithms for some classes of combinatorial linear programs
We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
Ulrich Faigle, Britta Peis
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
14 years 28 days ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...