Sciweavers

3192 search results - page 295 / 639
» The minimum latency problem
Sort
View
STACS
2007
Springer
16 years 22 days ago
Cost Sharing Methods for Makespan and Completion Time Scheduling
Abstract. Roughgarden and Sundararajan recently introduced an alternative measure of efficiency for cost sharing mechanisms. We study cost sharing methods for combinatorial optimiz...
Janina A. Brenner, Guido Schäfer
SYNASC
2005
IEEE
129views Algorithms» more  SYNASC 2005»
16 years 6 days ago
Logic Restructuring for Delay Balancing in Wave-Pipelined Circuits: An Integer Programming Approach
In this paper we apply integer programming (IP) based techniques to the problem of delay balancing in wave-pipelined circuits. The proposed approach considers delays, as well as f...
Srivastav Sethupathy, Nohpill Park, Marcin Paprzyc...
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
16 years 5 days ago
On strip packing With rotations
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
Klaus Jansen, Rob van Stee
MFCS
2005
Springer
16 years 3 days ago
Approximating Reversal Distance for Strings with Bounded Number of Duplicates
For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...
Petr Kolman
SPAA
2004
ACM
16 years 1 days ago
Balanced graph partitioning
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
Konstantin Andreev, Harald Räcke