Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `+publisher:"University of Illinois – Urbana-Champaign" +contributor:("Chandrasekaran, Karthekeyan")`

.
Showing records 1 – 5 of
5 total matches.

▼ Search Limiters

University of Illinois – Urbana-Champaign

1. Kwon, Hee Youn. New developments in causal inference using balance optimization subset selection.

Degree: PhD, Systems & Entrepreneurial Engr, 2018, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/100968

► Causal inference with observational data has drawn attention across various fields. These observational studies typically use matching methods which find matched pairs with similar covariate…
(more)

Subjects/Keywords: Causal Analysis; Optimization; Subset Selection

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Kwon, H. Y. (2018). New developments in causal inference using balance optimization subset selection. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/100968

Chicago Manual of Style (16^{th} Edition):

Kwon, Hee Youn. “New developments in causal inference using balance optimization subset selection.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 06, 2020. http://hdl.handle.net/2142/100968.

MLA Handbook (7^{th} Edition):

Kwon, Hee Youn. “New developments in causal inference using balance optimization subset selection.” 2018. Web. 06 Apr 2020.

Vancouver:

Kwon HY. New developments in causal inference using balance optimization subset selection. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/2142/100968.

Council of Science Editors:

Kwon HY. New developments in causal inference using balance optimization subset selection. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/100968

University of Illinois – Urbana-Champaign

2. Madan, Vivek. On approximability and LP formulations for multicut and feedback set problems.

Degree: PhD, Computer Science, 2018, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/102390

► Graph cut algorithms are an important tool for solving optimization problems in a variety of areas in computer science. Of particular importance is the min…
(more)

Subjects/Keywords: Approximation; Multicut; Feedback set; Linear programming relaxation; Hardness of approximation; Linear cut; Multiway cut; Subset feedback set; Flow-cut gap

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Madan, V. (2018). On approximability and LP formulations for multicut and feedback set problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/102390

Chicago Manual of Style (16^{th} Edition):

Madan, Vivek. “On approximability and LP formulations for multicut and feedback set problems.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 06, 2020. http://hdl.handle.net/2142/102390.

MLA Handbook (7^{th} Edition):

Madan, Vivek. “On approximability and LP formulations for multicut and feedback set problems.” 2018. Web. 06 Apr 2020.

Vancouver:

Madan V. On approximability and LP formulations for multicut and feedback set problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/2142/102390.

Council of Science Editors:

Madan V. On approximability and LP formulations for multicut and feedback set problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/102390

3. Xu, Chao. Cuts and connectivity in graphs and hypergraphs.

Degree: PhD, Computer Science, 2018, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/101009

► In this thesis, we consider cut and connectivity problems on graphs, digraphs, hypergraphs and hedgegraphs. The main results are the following: - We introduce a…
(more)

Subjects/Keywords: hypergraph; cuts

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Xu, C. (2018). Cuts and connectivity in graphs and hypergraphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/101009

Chicago Manual of Style (16^{th} Edition):

Xu, Chao. “Cuts and connectivity in graphs and hypergraphs.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 06, 2020. http://hdl.handle.net/2142/101009.

MLA Handbook (7^{th} Edition):

Xu, Chao. “Cuts and connectivity in graphs and hypergraphs.” 2018. Web. 06 Apr 2020.

Vancouver:

Xu C. Cuts and connectivity in graphs and hypergraphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/2142/101009.

Council of Science Editors:

Xu C. Cuts and connectivity in graphs and hypergraphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/101009

4. Gupta, Shalmoli. Approximation algorithms for clustering and facility location problems.

Degree: PhD, Computer Science, 2018, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/102419

► In this thesis we design and analyze algorithms for various facility location and clustering problems. The problems we study are NP-Hard and therefore, assuming P…
(more)

Subjects/Keywords: Approximation Algorithm; Clustering; Facility Location; Submodular function

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Gupta, S. (2018). Approximation algorithms for clustering and facility location problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/102419

Chicago Manual of Style (16^{th} Edition):

Gupta, Shalmoli. “Approximation algorithms for clustering and facility location problems.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 06, 2020. http://hdl.handle.net/2142/102419.

MLA Handbook (7^{th} Edition):

Gupta, Shalmoli. “Approximation algorithms for clustering and facility location problems.” 2018. Web. 06 Apr 2020.

Vancouver:

Gupta S. Approximation algorithms for clustering and facility location problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/2142/102419.

Council of Science Editors:

Gupta S. Approximation algorithms for clustering and facility location problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/102419

5. Baranwal, Mayank. Entropy-based framework for combinatorial optimization problems and enabling the grid of the future.

Degree: PhD, Mechanical Engineering, 2018, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/101489

► This thesis is divided into two parts. In the first part, I describe efficient meta-heuristic algorithms for a series of combinatorially complex optimization problems, while…
(more)

Subjects/Keywords: maximum entropy principle; combinatorial optimization; traveling salesman problem; clustering; multiway cut; microgrid; robust control; distributed control; converter; inverter

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Baranwal, M. (2018). Entropy-based framework for combinatorial optimization problems and enabling the grid of the future. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/101489

Chicago Manual of Style (16^{th} Edition):

Baranwal, Mayank. “Entropy-based framework for combinatorial optimization problems and enabling the grid of the future.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 06, 2020. http://hdl.handle.net/2142/101489.

MLA Handbook (7^{th} Edition):

Baranwal, Mayank. “Entropy-based framework for combinatorial optimization problems and enabling the grid of the future.” 2018. Web. 06 Apr 2020.

Vancouver:

Baranwal M. Entropy-based framework for combinatorial optimization problems and enabling the grid of the future. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/2142/101489.

Council of Science Editors:

Baranwal M. Entropy-based framework for combinatorial optimization problems and enabling the grid of the future. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/101489