Learn More
Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include maximum independent set, minimum vertex cover, minimum coloring and minimum dominating set. We also present an on-line(More)
Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include maximum independent set, minimum vertex cover, minimum coloring and minimum dominating set. We also present an on-line(More)
zun~iehst verbliifft m~d suchten naeh Ursachen, k6nnen aber Ms einzige Erkl~rm~g nur annehmen, dab die Kreise dank der 25--30j~hrigen Faehfiirsorge gut durchgearbeitet sind, dab es sich also gewissermaBen um alten guten Kulturboden handelt, auf dem Unkraut schleeht gedeiht~ Es wurde heute yon Heflst~ttenbauten beriehtet, die viele Millionen kosten. Leider,(More)
  • 1