Home
Resource
Computational aspects of some geometric and analytic problems
PDF
PDF format is widely accepted and good for printing.
Plug-in required
Access to this PDF has been restricted at the author's request. It will be publicly available after April 27, 2024.
Citation & Export
View Usage Statistics
Staff View

Citation & Export
Hide

Simple citation

Gavva, Surya Teja. Computational aspects of some geometric and analytic problems. Retrieved from https://doi.org/doi:10.7282/t3-sr8k-dm33

Export

Click here for information about Citation Management Tools at Rutgers.

Statistics
Hide

Description

TitleComputational aspects of some geometric and analytic problems
NameGavva, Surya Teja (author); Srikanta, Karthik (chair); Narayanan, Bhargav (member); Saks, Michael (member); Shinkar, Igor (member); Rutgers University; School of Graduate Studies
Date Created2023
Other Date2023-05 (degree)
SubjectMathematics, Computer science, Clustering, Discrepancy, Hardness of approximation, Kadison-Singer, Lower bounds, Steiner tree
Extent289 pages : illustrations
DescriptionThis thesis is about some recent work on computational aspects of problems in geometry and analysis. We consider some problems about the hardness of approximation of discrete Steiner trees, computation of explicit signings in the Kadison-Singer problem for graphs, contact dimensions of graphs in Hamming metric, lower bounds on depth for decision tree clustering, soft-rounding variant of k-modes algorithm for clustering categorical data and fairness aspects of linear regression.
NotePh.D.
NoteIncludes bibliographical references
Genretheses
Persistent URLhttps://doi.org/doi:10.7282/t3-sr8k-dm33
LanguageEnglish
CollectionSchool of Graduate Studies Electronic Theses and Dissertations
Organization NameRutgers, The State University of New Jersey
RightsThe author owns the copyright to this work.
Version 8.5.1
Rutgers University Libraries - Copyright ©2023