187 search results - page 29 / 38 » Improved Approximation of MAX-CUT on Graphs of Bounded Degre... |
113
click to vote
ALGORITHMICA
2006
14 years 11 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
113
Voted
SAC
2003
ACM
15 years 4 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
116
Voted
PDP
2005
IEEE
15 years 5 months ago
2005
IEEE
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
111
Voted
DASFAA
2008
IEEE
15 years 1 months ago
2008
IEEE
The increase in the advanced location based services such as traffic coordination and management necessitates the need for advanced models tracking the positions of Moving Objects ...
84
Voted
ISPAN
1997
IEEE
15 years 3 months ago
1997
IEEE
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm wi...