On greedy and submodular matrices

Faigle, Ulrich and Kern, Walter and Peis, Britta (2011) On greedy and submodular matrices. In: First International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS 2011, 18-20 April 2011, Rome, Italy.

PDF
Restricted to UT campus only: Request a copy
212Kb

Abstract:	We characterize non-negative greedy matrices, i.e., 0-1 matrices A such that max ${cTx\|Ax ≤ b,x ≥ 0}$ can be solved greedily. We identify submodular matrices as a special subclass of greedy matrices. Finally, we extend the notion of greediness to {-1,0,+1\}-matrices. We present numerous applications of our results. [brace not closed]
Item Type:	Conference or Workshop Item
Copyright:	© 2011 Springer
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/76831
Official URL:	http://dx.doi.org/10.1007/978-3-642-19754-3_13
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 277616