Sciweavers

3875 search results - page 34 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
ASIAN
1999
Springer
86views Algorithms» more  ASIAN 1999»
15 years 10 months ago
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs
Tiziana Calamoneri, Irene Finocchi, Yannis Manouss...
ISAAC
1993
Springer
106views Algorithms» more  ISAAC 1993»
15 years 10 months ago
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
Ulrich Fößmeier, Michael Kaufmann, Alex...
APPROX
2006
Springer
103views Algorithms» more  APPROX 2006»
15 years 9 months ago
Approximation Algorithms for Graph Homomorphism Problems
Michael Langberg, Yuval Rabani, Chaitanya Swamy
ISAAC
1998
Springer
153views Algorithms» more  ISAAC 1998»
15 years 10 months ago
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang