Maximum matching in the online preemptive model, and approximability of the minimum rainbow subgraph problem (R)
Language: English Publication details: Bombay ; IIT ; 2017Description: iii,78 p; 30 cmSubject(s): Vishwanathan, Sundar | Theses and Dissertations | Computer algorithms | Online algorithms | Combinatorial optimization-Data processing | Graph theory-Data processingDissertation note: Thesis Ph.D Indian Institute of Technology Bombay. Department of Computer Science and Engineering 2017| Item type | Current library | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
Theses and Dissertations
|
Central Library, IITB Pamphlet Section (Theses, Standards, Reports) | 043:681.3.06:518.4Tir | Not for loan | 241241 |
Total holds: 0
Thesis Ph.D Indian Institute of Technology Bombay. Department of Computer Science and Engineering 2017
There are no comments on this title.