%0 Conference Paper %1 conf/jcdcg/Matsui98 %A Matsui, Tomomi %B JCDCG %D 1998 %E Akiyama, Jin %E Kano, Mikio %E Urabe, Masatsugu %I Springer %K dblp %P 194-200 %T Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs. %U http://dblp.uni-trier.de/db/conf/jcdcg/jcdcg1998.html#Matsui98 %V 1763 %@ 3-540-67181-1

@inproceedings{conf/jcdcg/Matsui98, added-at = {2017-05-24T00:00:00.000+0200}, author = {Matsui, Tomomi}, biburl = {https://www.bibsonomy.org/bibtex/2221f0d2dbdb86ca45035e32c631682ef/dblp}, booktitle = {JCDCG}, crossref = {conf/jcdcg/1998}, editor = {Akiyama, Jin and Kano, Mikio and Urabe, Masatsugu}, ee = {https://doi.org/10.1007/978-3-540-46515-7_16}, interhash = {47d1c34eb1b4954c1d27879237174487}, intrahash = {221f0d2dbdb86ca45035e32c631682ef}, isbn = {3-540-67181-1}, keywords = {dblp}, pages = {194-200}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-06-04T12:52:44.000+0200}, title = {Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs.}, url = {http://dblp.uni-trier.de/db/conf/jcdcg/jcdcg1998.html#Matsui98}, volume = 1763, year = 1998 }