Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/702
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jhingonia, Anil Kumar | - |
dc.date.accessioned | 2016-09-13T08:59:23Z | - |
dc.date.available | 2016-09-13T08:59:23Z | - |
dc.date.issued | 2015-06-25 | - |
dc.identifier.uri | http://hdl.handle.net/123456789/702 | - |
dc.description.abstract | The primal-dual method is a standard tool in the design of algorithms for combinato- rial optimization problems. It is a very powerful method. This method can be used to obtain a good approximation algorithm from which we can get a good combinatorial algorithm. It can also be used to prove good performance for combinatorial algo- rithms. Max- ow Min-cut is a very nice example of primal dual method. we would like to interpret its primal, then obtain its dual, interpret the dual and then prove the max- ow min-cut theorem using the strong duality. | en_US |
dc.description.sponsorship | IISER-M | en_US |
dc.language.iso | en | en_US |
dc.publisher | IISER-M | en_US |
dc.subject | Mathematics | en_US |
dc.subject | Matrix | en_US |
dc.subject | Ellipsoid Algorithm | en_US |
dc.subject | Primal Dual Algorithm | en_US |
dc.title | Study of Combinatorial Optimization | en_US |
dc.type | Thesis | en_US |
Appears in Collections: | MS-09 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
MS-09015.pdf | 53.68 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.