Submodular function minimization

Please use this identifier to cite or link to this item: http://repository.iiitd.edu.in/xmlui/handle/123456789/693

Full metadata record

DC Field	Value	Language
dc.contributor.author	Goswami, Shubham
dc.contributor.author	Arora, Chetan (Advisor)
dc.date.accessioned	2018-09-25T09:59:10Z
dc.date.available	2018-09-25T09:59:10Z
dc.date.issued	2017-11-17
dc.identifier.uri	http://repository.iiitd.edu.in/xmlui/handle/123456789/693
dc.description.abstract	Sum of submodular function minimization is a combinatorial optimization problem(NP-Hard), We begin with the Submodular function minimization and extending it to Sum of submodular function(SOS), there are different algorithms dealing with this problem the best in running time known is Min Norm Point Algorithm for Higher Order MRF-MAP Inference by (Ishant Shanu, Dr. Chetan Arora, Pagar Singla), The approach that is used in this report uses cutting Plane and other convex optimization Methods which are best known to deal with convex optimization problems and we use it for Submodular function minimization.	en_US
dc.language.iso	en_US	en_US
dc.publisher	IIIT-Delhi	en_US
dc.subject	Complexity	en_US
dc.subject	Algorithms	en_US
dc.subject	Convex optimization	en_US
dc.subject	linear programming	en_US
dc.title	Submodular function minimization	en_US
dc.type	Other	en_US
Appears in Collections:	Year-2018

Files in This Item:

File	Description	Size	Format
Shubham Goswami_2014100.pdf Restricted Access		320.38 kB	Adobe PDF	View/Open Request a copy

DSpace JSPUI