765 research outputs found
On the performance of edge coloring algorithms for cubic graphs
This thesis visits the forefront of algorithmic research on edge coloring of cubic graphs. We select a set of algorithms that are among the asymptotically fastest known today. Each algorithm has exponential time complexity, owing to the NP-completeness of edge coloring, but their space complexities differ greatly. They are implemented in a popular high-level programming language to compare their performance on a set of real instances. We also explore ways to parallelize each of the algorithms and discuss what benefits and detriments those implementations hold
A Simple Greedy Algorithm for Dynamic Graph Orientation
Graph orientations with low out-degree are one of several ways to efficiently store sparse graphs. If the graphs allow for insertion and deletion of edges, one may have to flip the orientation of some edges to prevent blowing up the maximum out-degree. We use arboricity as our sparsity measure. With an immensely simple greedy algorithm, we get parametrized trade-off bounds between out-degree and worst case number of flips, which previously only existed for amortized number of flips. We match the previous best worst-case algorithm (in O(log n) flips) for general arboricity and beat it for either constant or super-logarithmic arboricity. We also match a previous best amortized result for at least logarithmic arboricity, and give the first results with worst-case O(1) and O(sqrt(log n)) flips nearly matching degree bounds to their respective amortized solutions
Applications of incidence bounds in point covering problems
In the Line Cover problem a set of n points is given and the task is to cover
the points using either the minimum number of lines or at most k lines. In
Curve Cover, a generalization of Line Cover, the task is to cover the points
using curves with d degrees of freedom. Another generalization is the
Hyperplane Cover problem where points in d-dimensional space are to be covered
by hyperplanes. All these problems have kernels of polynomial size, where the
parameter is the minimum number of lines, curves, or hyperplanes needed. First
we give a non-parameterized algorithm for both problems in O*(2^n) (where the
O*(.) notation hides polynomial factors of n) time and polynomial space,
beating a previous exponential-space result. Combining this with incidence
bounds similar to the famous Szemeredi-Trotter bound, we present a Curve Cover
algorithm with running time O*((Ck/log k)^((d-1)k)), where C is some constant.
Our result improves the previous best times O*((k/1.35)^k) for Line Cover
(where d=2), O*(k^(dk)) for general Curve Cover, as well as a few other bounds
for covering points by parabolas or conics. We also present an algorithm for
Hyperplane Cover in R^3 with running time O*((Ck^2/log^(1/5) k)^k), improving
on the previous time of O*((k^2/1.3)^k).Comment: SoCG 201
The Outdoors as a Common Site of Experience and Collaboration in Art and Technology Education – A Workshop Model
Recommended from our members
Final test report: demonsration testing in support of the Track 3system waste dislodging, retrieval and conveyance concepts
This report contains the quantitative and qualitative data and information collected during performance of the Track 3 System testing protocol. Information contained herein focuses on the data collected during performance ofthe following Tests Procedures. *Test Procedure-1, Position Management Test Procedure-2, Waste Dislodging, Retrieval, and Conveyance and Decontamination *Test Procedure-3, Dynamic Response Test procedures, Safety Demonstratio
Recommended from our members
Issues associated with manipulator-based waste retrieval from Hanford underground storage tanks with a preliminary review of commercial concepts
Westinghouse Hanford Company (WHC) is exploring commercial methods for retrieving waste from the underground storage tanks at the Hanford site in south central Washington state. WHC needs data on commercial retrieval systems equipment in order to make programmatic decisions for waste retrieval. Full system testing of retrieval processes is to be demonstrated in phases through September 1997 in support of programs aimed to Acquire Commercial Technology for Retrieval (ACTR) and at the Hanford Tanks Initiative (HTI). One of the important parts of the integrated testing will be the deployment of retrieval tools using manipulator-based systems. WHC requires an assessment of a number of commercial deployment systems that have been identified by the ACTR program as good candidates to be included in an integrated testing effort. Included in this assessment should be an independent evaluation of manipulator tests performed to date, so that WHC can construct an integrated test based on these systems. The objectives of this document are to provide a description of the need, requirements, and constraints for a manipulator-based retrieval system; to evaluate manipulator-based concepts and testing performed to date by a number of commercial organizations; and to identify issues to be resolved through testing and/or analysis for each concept
Recommended from our members
Hanford tank initiative vehicle/based waste retrieval demonstration report phase II, track 2
Using the versatile TracPUMpTm, Environmental Specialties Group, LLC (ES) performed a successful Phase 11 demonstration of a Vehicle- Based Waste Retrieval System (VWRS) for removal of waste material and residual liquid found in the Hanford Underground Storage Tanks (ousts). The purpose of this demonstration was to address issues pertaining to the use of a VWRS in OUSTS. The demonstration also revealed the waste removal capabilities of the TracPumpTm and the most effective techniques and equipment to safely and effectively remove waste simulants. ES successfully addressed the following primary issues: I . Dislodge and convey the waste forms present in the Hanford OUSTS; 2. Access the UST through tank openings as small as twenty-four inches in diameter; 3. Traverse a variety of terrains including slopes, sludges, rocks and hard, slippery surfaces without becoming mired; 4. Dislodge and convey waste within the confinement of the Decontamination Containment Capture Vessel (DCCV) and with minimal personnel exposure; 5. Decontaminate equipment to acceptable limits during retrieval from the UST; 6. Perform any required maintenance within the confinement of the DCCV; and 7. Maintain contaminate levels ``as low as reasonably achievable`` (ALARA) within the DCCV due to its crevice and comer-free design. The following materials were used to simulate the physical characteristics of wastes found in Hanford`s OUSTS: (1) Hardpan: a clay-type material that has high shear strength; (2) Saltcake: a fertilizer-based material that has high compressive strength; and (3) Wet Sludge.- a sticky, peanut- butter- like material with low shear strength. Four test beds were constructed of plywood and filled with a different simulant to a depth of eight to ten inches. Three of the test beds were of homogenous simulant material, while the fourth bed consisted of a mixture of all three simulant types
- …