@techreport{TD:100599,
	att_abstract={{In this paper, we study interference networks with
local views, where each node only knows the channel gains of
h hops around them, leading to mismatched knowledge about
the network. For networks with a local view, we propose a
new sub-network scheduling called Maximal k-Clique Scheduling
(MCS). A key benefit of MCS is that it can be explicitly
constructed and hence easier to analyze compared to prior subgraph
schedulers. Our main result is that MCS can be used to
bound the performance from above and below of a more complex
sub-graph scheduling algorithm, known as Maximal Independent
Graph Scheduling (MIGS), which in many cases does not have
a known explicit construction.}},
	att_authors={va037f},
	att_categories={C_CCF.3},
	att_copyright={{IEEE}},
	att_copyright_notice={{This version of the work is reprinted here with permission of IEEE for your personal use. Not for redistribution. The definitive version was published in Annual Allerton Conference on Communication, Control, and Computing {{, 2011-09-30}}
}},
	att_donotupload={},
	att_private={false},
	att_projects={},
	att_tags={},
	att_techdoc={true},
	att_techdoc_key={TD:100599},
	att_url={http://web1.research.att.com:81/techdocs_downloads/TD:100599_DS1_2011-10-04T20:54:52.352Z.pdf},
	author={Vaneet Aggarwal and Salman Avestimehr and Ashutosh Sabharwal and Kanes Sutuntivorakoon},
	institution={{Annual Allerton Conference on Communication, Control, and Computing}},
	month={September},
	title={{Maximal k-Clique Scheduling: A simple algorithm to bound maximal independent graph scheduling}},
	year=2011,
}