Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

AAIM
2007
Springer

favoriteEmaildiscussreport

127views Algorithms» more AAIM 2007»

Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs

14 years 12 days ago

Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs

Download www.lab2.kuis.kyoto-u.ac.jp

Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas

Real-time Traffic

AAIM 2007 | Algorithms |

claim paper

Related Content

» Optimization problems in multiple subtree graphs

» Approximation algorithms for finding and partitioning unitdisk graphs into cokplexes

» Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs

» Greedy Algorithms for Minimisation Problems in Random Regular Graphs

» An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs

» Fast distributed approximation algorithms for vertex cover and set cover in anonymous netw...

» ConstantTime Approximation Algorithms via Local Improvements

» Quadruple systems with independent neighborhoods

» An improved constanttime approximation algorithm for maximummatchings

Post Info
More Details (n/a)

Added	06 Jun 2010
Updated	06 Jun 2010
Type	Conference
Year	2007
Where	AAIM
Authors	Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas

Comments (0)