Index Catalog // ScholarsArchive@OSU

Start Over

Filtering by: Creator Parker, Kai Committee Member Tadepalli, Prasad Peer Reviewed No

Approximation Schemes in Planar Graphs

Creator:

Zheng, Baigong

Abstract:

There are growing interests in designing polynomial-time approximation schemes (PTAS) for optimization problems in planar graphs. Many NP-hard problems are shown to admit PTAS in planar graphs in the last decade, including Steiner tree, Steiner forest, two- edge-connected subgraphs and so on. We follow this research line and study several...

Resource Type:

Dissertation
Topics in toroidal interconnection networks

Creator:

Broeg, Robert Richard

Resource Type:

Dissertation

Full Text:

, Sheryl Parker, Clara Knutson, Joe Alvarez, and the rest of the office staff have reified the expression
Explanations and Processes to Enable Humans to Assess AI with Respect to Manipulable Properties

Creator:

Dodge, Jonathan E.

Abstract:

Assessing AI systems is difficult. Humans rely on AI systems in increasing ways, both visible and invisible, meaning a variety of stakeholders need a variety of assessment tools (e.g., a professional auditor, a developer, and an end user all have different needs). We posit that it is possible to provide...

Resource Type:

Dissertation