@techreport{,
	att_abstract={The antibandwidth maximization problem aims to maximize the minimum distance of entries of a sparse
symmetric matrix from the diagonal and as such may be regarded as the dual of the well-known bandwidth
minimization problem. In this paper, we consider the feasibility of adapting heuristic algorithms for the
bandwidth minimization problem to the antibandwidth maximization problem. In particular, using an
inexpensive level-based heuristic we obtain an initial ordering that we refine using a hill-climbing algorithm.
This approach performs well on matrices coming from a range of practical problems with an underlying
mesh. Comparisons with existing approaches show that, on this class of problems, our algorithm can be
competitive with recently reported results in terms of quality while being significantly faster and applicable
to much larger problems.
},
	att_authors={yh573v},
	att_categories={C_CCF.1},
	att_copyright={Wiley-Blackwell},
	att_copyright_notice={The definitive version was published in  2012. {{, 2012-10-01}}
},
	att_donotupload={},
	att_private={false},
	att_projects={},
	att_tags={},
	att_techdoc={true},
	att_techdoc_key={TD:100986},
	att_url={http://web1.research.att.com:81/techdocs_downloads/TD:100986_DS1_2012-09-10T17:28:24.312Z.pdf},
	author={Jennifer Scott AND Yifan Hu},
	institution={{Numerical Linear Algebra with Applications}},
	month={October},
	title={{Level-based heuristics and hill climbing for the antibandwidth maximization problem}},
	year=2012,
}