Sciweavers

3875 search results - page 13 / 775
» Approximation Algorithms for the Max-coloring Problem
Sort
View
APPROX
2006
Springer
103views Algorithms» more  APPROX 2006»
13 years 11 months ago
Approximation Algorithms for Graph Homomorphism Problems
Michael Langberg, Yuval Rabani, Chaitanya Swamy
SODA
2012
ACM
210views Algorithms» more  SODA 2012»
11 years 10 months ago
Approximation algorithms and hardness of the k-route cut problem
Julia Chuzhoy, Yury Makarychev, Aravindan Vijayara...
ISAAC
1998
Springer
153views Algorithms» more  ISAAC 1998»
13 years 11 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
ALGORITHMICA
2005
99views more  ALGORITHMICA 2005»
13 years 7 months ago
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
Marek Karpinski, Ion I. Mandoiu, Alexander Olshevs...