4843 search results - page 151 / 969 » The Shortcut Problem - Complexity and Approximation |
116
click to vote
JPDC
2007
15 years 3 months ago
2007
We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of 3 2 + √ 2....
144
click to vote
IPL
2002
15 years 2 months ago
2002
The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation
107
click to vote
CORR
2010
Springer
15 years 17 days ago
2010
Springer
Given a bidirected ring with capacities and a demand graph, we present an approximate solution to the problem of nding the minimum such that there exists a feasible routing of the...
110
click to vote
ICDT
2005
ACM
15 years 8 months ago
2005
ACM
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
123
click to vote
TOC
2008
15 years 3 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...