Maximum matching in the online preemptive model, and approximability of the minimum rainbow subgraph problem (R)
Tirodkar, Sumedh
Maximum matching in the online preemptive model, and approximability of the minimum rainbow subgraph problem (R) - Bombay IIT 2017 - iii,78 p. 30 cm
Thesis
Vishwanathan, Sundar
Theses and Dissertations
Computer algorithms
Online algorithms
Combinatorial optimization-Data processing
Graph theory-Data processing
043:681.3.06:518.4 / Tir
Maximum matching in the online preemptive model, and approximability of the minimum rainbow subgraph problem (R) - Bombay IIT 2017 - iii,78 p. 30 cm
Thesis
Vishwanathan, Sundar
Theses and Dissertations
Computer algorithms
Online algorithms
Combinatorial optimization-Data processing
Graph theory-Data processing
043:681.3.06:518.4 / Tir