Sciweavers

3875 search results - page 13 / 775
» Approximation Algorithms for the Max-coloring Problem
Sort
View
APPROX
2006
Springer
103views Algorithms» more  APPROX 2006»
15 years 6 months ago
Approximation Algorithms for Graph Homomorphism Problems
Michael Langberg, Yuval Rabani, Chaitanya Swamy
103
Voted
SODA
2012
ACM
210views Algorithms» more  SODA 2012»
13 years 4 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»
15 years 6 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
92
Voted
SODA
1998
ACM
68views Algorithms» more  SODA 1998»
15 years 3 months ago
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
Martin W. P. Savelsbergh, R. N. Uma, Joel Wein
ALGORITHMICA
2005
99views more  ALGORITHMICA 2005»
15 years 2 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...