Back to Results
First PageMeta Content
NP-complete problems / Graph coloring / Domatic number / Dominating set / Independent set / Greedy coloring / Topology / Maximal independent set / Graph / Graph theory / Theoretical computer science / Mathematics


CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximating the Independent Domatic Partition Problem in Random Geometric Graphs – An Experimental Study Dhia Mahjoub
Add to Reading List

Document Date: 2010-07-19 10:46:18


Open Document

File Size: 99,02 KB

Share Result on Facebook

City

Dallas / /

Company

Wireless Sensor Networks / Intel / Microsoft / CRC Press / /

/

Facility

Southern Methodist University / Microsoft Visual Studio / /

IndustryTerm

by-product / energy conservation / sensor networks / partition solution / cartesian products / Wireless Communications / distributed geometry-aware algorithm / self-organizing sensor networks / model Wireless / /

MarketIndex

set 20 / /

OperatingSystem

Windows Vista Enterprise / Linux / CentOS / /

Organization

Department of Computer Science / Southern Methodist University / IDF / Engineering Management / Information / and Systems Department / /

Person

David W. Matula / Jeffery L. Kennington / /

/

Position

ILP model / SL and DLX coloring methodology respectively / representative / /

ProvinceOrState

Texas / /

Technology

3 Algorithms / RAM / distributed geometry-aware algorithm / ILP algorithms / ILP-based algorithms / Linux / 2 Duo E8400 processor / Wireless Communications / Mobile Computing / Coloring algorithms / Approximation algorithms / known coloring algorithms / /

SocialTag