Results 1 
5 of
5
Improved results for directed multicut
 In Proc. of SODA, 2003
, 2003
"... We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives anapproximation. This improves on the previous approximation guarantee of ��of Cheriyan, Karloff and Rabani [1], which was obtained by a more sophisticated algorithm. 1 ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives anapproximation. This improves on the previous approximation guarantee of ��of Cheriyan, Karloff and Rabani [1], which was obtained by a more sophisticated algorithm. 1
Improved approximation for directed cut problems
 In STOC
, 2007
"... We present improved approximation algorithms for directed multicut and directed sparsest cut. The current best known approximation ratio for these problems is O(n 1/2). We obtain an Õ(n11/23)approximation. Our algorithm works with the natural LP relaxation used in prior work. We use a randomized ro ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
We present improved approximation algorithms for directed multicut and directed sparsest cut. The current best known approximation ratio for these problems is O(n 1/2). We obtain an Õ(n11/23)approximation. Our algorithm works with the natural LP relaxation used in prior work. We use a randomized rounding algorithm with a more sophisticated charging scheme and analysis to obtain our improvement. This also implies a Õ(n11/23) upper bound on the ratio between the maximum multicommodity flow and minimum multicut in directed graphs.
And M.H.Kashani “ A Genetic Algorithm For Process Scheduling
 In Distributed Operating Systems Considering Load Balancing”, European Conference On Modelling And Simulation
"... Distributed systems, scheduling, genetic algorithm, simulated annealing, load balancing. This paper presents and evaluates a new method for process scheduling in distributed systems. Scheduling in distributed operating systems has a significant role in overall system performance and throughput. An e ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Distributed systems, scheduling, genetic algorithm, simulated annealing, load balancing. This paper presents and evaluates a new method for process scheduling in distributed systems. Scheduling in distributed operating systems has a significant role in overall system performance and throughput. An efficient scheduling is vital for system performance. The scheduling in distributed systems is known as an NPcomplete problem even in the best conditions, and methods based on heuristic search have been proposed to obtain optimal and suboptimal solutions. In this paper, using the power of genetic algorithms we solve this problem considering load balancing efficiently. We evaluate the performance and efficiency of the proposed algorithm using simulation results.
File Allocation Algorithms to Minimize Data Transmission Time in Distributed Computing Systems *+
, 1998
"... This work addresses a files allocation problem (FAP) in distributed computing systems. This FAP attempts to minimize the expected data transfer time for a specific program that must access several data files from nonperfect computer sites. We assume that communication capacity can be reserved; henc ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This work addresses a files allocation problem (FAP) in distributed computing systems. This FAP attempts to minimize the expected data transfer time for a specific program that must access several data files from nonperfect computer sites. We assume that communication capacity can be reserved; hence, the data transmission behavior is modeled as a manytoone multicommodity flow problem. A new criticalcut method is proposed to solve this reduced multicommodity flow problem. Based on this method, two algorithms which use branchandbound are proposed for this FAP. The proposed algorithms are able to allocate data files having single copies or multiple replicated copies. Simulation results are presented to demonstrate the performance of the algorithms.
Categories and Subject Descriptors F.2 [Theory of Computation]: Analysis of Algorithms General Terms
"... We present improved approximation algorithms for directed multicut and directed sparsest cut. The current best known approximation ratio for these problems is O(n 1/2). We obtain an Õ(n11/23)approximation. Our algorithm works with the natural LP relaxation used in prior work. We use a randomized ro ..."
Abstract
 Add to MetaCart
We present improved approximation algorithms for directed multicut and directed sparsest cut. The current best known approximation ratio for these problems is O(n 1/2). We obtain an Õ(n11/23)approximation. Our algorithm works with the natural LP relaxation used in prior work. We use a randomized rounding algorithm with a more sophisticated charging scheme and analysis to obtain our improvement. This also implies a Õ(n11/23) upper bound on the ratio between the maximum multicommodity flow and minimum multicut in directed graphs.