Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"packing and covering"”.
-
Packings and Coverings of Various Complete Digraphs with the Orientations of a 4-Cycle.
… of cycles on four vertices. Necessary and sufficient conditions are given for covering complete directed digraphs <em>D<sub>v</sub></em>, packing and covering complete bipartite digraphs, <em>D<sub>m,n</sub></em>, and packing and covering the complete digraph on <em>v</em> vertices with …
-
Fast approximations for combinatorial optimization via multiplicative weight updates
… several LP relaxations that arise in discrete and combinatorial optimization. New results include improved running times for explicit mixed packing and covering problems, nearly linear time approximations for tree packings, nearly linear time approximations for the Held Karp bound (leading to a …
-
View Point Planning for Inspecting Static and Dynamic Scenes with Multi-Robot Teams
… the problem of viewpoint planning in static and dynamic scenes using multi-robot teams. This work is motivated by two applications: bridge inspection and environmental monitoring using Unmanned Aerial Vehicles. For static scenes, we are given a set of target points in a polygonal environment …
-
Problems in list coloring, triangle covering, and pursuit-evasion games
Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2014-07-14T16:02:09Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 11 littletuza.tex: 12675 bytes, checksum: addf3766f19108432eeb6fc23765de37 (MD5) uiucthesis2009.cls: 17082 bytes, checksum: …
-
Improved Approximation Algorithms for Geometric Packing Problems With Experimental Evaluation
Geometric packing problems are NP-complete problems that arise in VLSI design. In this thesis, we present two novel algorithms using dynamic programming to compute exactly the maximum number of k x k squares of unit size that can be packed without overlap into a given n x m grid. The first …