{"id":{"repo_id":"colostate","oai_identifier":"oai:mountainscholar.org:10217/191438"},"canonical_url":"https://search.dev.ndltd.org/etd/colostate/oai:mountainscholar.org:10217/191438","repository":{"repo_id":"colostate","name":"Colorado State University","base_url":"https://api.mountainscholar.org/server/oai/request"},"display":{"title":"Performance bounds for greedy strategies in submodular optimization problems","abstract":"To view the abstract, please see the full text of the document.","abstract_html":"To view the abstract, please see the full text of the document.","abstract_has_math":false,"creators":["Liu, Yajing, author","Chong, Edwin K. P., advisor","Pezeshki, Ali, advisor","Luo, J. Rockey, committee member","Bates, Dan, committee member"],"institution":"Colorado State University. Libraries","degree_name":"Doctor of Philosophy (Ph.D.)","degree_level":"Doctoral","degree_discipline":"Electrical and Computer Engineering","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2018,"date_issued":"2018","date_published":"2018","updated_at":"2026-07-27T19:13:18Z","subjects":["curvature","matroid","submodular","greedy","approximate dynamic programming","polymatroid"],"languages":["eng","English"],"rights":["Copyright and other restrictions may apply. User is responsible for compliance with all applicable laws. For information about copyright law, please see https://libguides.colostate.edu/copyright."],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.25675/3.018835"],"render_values":[{"text":"https://doi.org/10.25675/3.018835","href":"https://doi.org/10.25675/3.018835","code":true}]}]},"links":{"outbound_url":"https://hdl.handle.net/10217/191438","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Liu, Yajing, author","Chong, Edwin K. P., advisor","Pezeshki, Ali, advisor","Luo, J. Rockey, committee member","Bates, Dan, committee member"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2018-09-10T20:05:23Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2018-09-10T20:05:23Z"]},{"key":"dc:date.issued","label":"Date","values":["2018"]},{"key":"dc:publisher","label":"Institution","values":["Colorado State University. Libraries"]},{"key":"dc:type","label":"Dc Type","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy (Ph.D.)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Colorado State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["curvature","matroid","submodular","greedy","approximate dynamic programming","polymatroid"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright and other restrictions may apply. User is responsible for compliance with all applicable laws. For information about copyright law, please see https://libguides.colostate.edu/copyright."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["Liu_colostate_0053A_15032.pdf"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10217/191438","https://doi.org/10.25675/3.018835"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["To view the abstract, please see the full text of the document."]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["born digital","doctoral dissertations"]},{"key":"dc:title","label":"Title","values":["Performance bounds for greedy strategies in submodular optimization problems"]}]}],"canonical_facts":{"dc:creator":["Liu, Yajing, author","Chong, Edwin K. P., advisor","Pezeshki, Ali, advisor","Luo, J. Rockey, committee member","Bates, Dan, committee member"],"dc:date.accessioned":["2018-09-10T20:05:23Z"],"dc:date.available":["2018-09-10T20:05:23Z"],"dc:date.issued":["2018"],"dc:description.abstract":["To view the abstract, please see the full text of the document."],"dc:format.medium":["born digital","doctoral dissertations"],"dc:identifier":["Liu_colostate_0053A_15032.pdf"],"dc:identifier.uri":["https://hdl.handle.net/10217/191438","https://doi.org/10.25675/3.018835"],"dc:language":["English"],"dc:language.iso":["eng"],"dc:publisher":["Colorado State University. Libraries"],"dc:rights":["Copyright and other restrictions may apply. User is responsible for compliance with all applicable laws. For information about copyright law, please see https://libguides.colostate.edu/copyright."],"dc:subject":["curvature","matroid","submodular","greedy","approximate dynamic programming","polymatroid"],"dc:title":["Performance bounds for greedy strategies in submodular optimization problems"],"dc:type":["Text"],"thesis:degree_discipline":["Electrical and Computer Engineering"],"thesis:degree_level":["Doctoral"],"thesis:degree_name":["Doctor of Philosophy (Ph.D.)"],"thesis:institution_name":["Colorado State University"]},"updated_at":"2026-07-27T19:13:18Z"}