Results 1 
4 of
4
Fast Graph Partitioning Algorithms
, 1995
"... In this work, the following kway graph partitioning (GP) problem is considered: given an undirected weighted graph G(V; E), partition the nodes of G into k parts of almost equal size such that the partitioncost (sum of the weights on edges with nodes in different parts) is minimized. Two simple ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
and fast algorithms are proposed, namely, direct algorithm Auction and iterative algorithm GreedyCycle. In algorithm Auction, the idea of using auction and biddings is introduced using the masterworkers paradigm. Algorithm GreedyCycle is a greedy algorithm where the idea of cyclic node passing among
Sequential And Distributed Algorithms For Fast Graph Partitioning
, 1994
"... In this thesis, we deal with the following kway graph partitioning (GP) problem: given an undirected weighted graph G(V; E), partition the nodes of G into k parts of almost equal size such that the partitioncost (sum of the weights on edges with nodes in different parts) is minimized. We propose ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
some simple and fast algorithms for this problem for both sequential and distributed computing environments. We give three main algorithms for graph partitioning: direct algorithm Auction; and iterative algorithms GreedyPass and GreedyCycle. In the algorithm Auction, we introduce the idea of using
Approximation algorithms for timedependent orienteering
, 2000
"... The timedependent orienteering problem is dual to the timedependent traveling salesman problem. It consists of visiting a maximum number of sites within a given deadline. The traveling time between two sites is in general dependent on the starting time. For any ε> 0, we provide a (2 + ε)approx ..."
Abstract
 Add to MetaCart
)approximation algorithm for the timedependent orienteering problem which runs in polynomial time if the ratio between the maximum and minimum traveling time between any two sites is constant. No prior upper approximation bounds were known for this timedependent problem. 2001 Elsevier Science B.V. All rights reserved.