{"type":"mastersthesis","date_updated":"2022-01-06T07:01:59Z","_id":"555","title":"Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs","department":[{"_id":"79"}],"date_created":"2017-10-17T12:42:40Z","user_id":"477","citation":{"bibtex":"@book{Setzer_2013, title={Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs}, publisher={Universität Paderborn}, author={Setzer, Alexander}, year={2013} }","chicago":"Setzer, Alexander. Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs. Universität Paderborn, 2013.","short":"A. Setzer, Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs, Universität Paderborn, 2013.","ieee":"A. Setzer, Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs. Universität Paderborn, 2013.","ama":"Setzer A. Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs. Universität Paderborn; 2013.","mla":"Setzer, Alexander. Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs. Universität Paderborn, 2013.","apa":"Setzer, A. (2013). Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs. Universität Paderborn."},"year":"2013","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"publisher":"Universität Paderborn","author":[{"first_name":"Alexander","full_name":"Setzer, Alexander","last_name":"Setzer","id":"11108"}]}