Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
"Graph-theoretic generalization of the secretary problem; selecting a best twin Grzegorz Kubicki , University of Louisville Michal Morayne, Wroclaw University of Technology Consider a poset P consisting of two chains of the same length; the only uncom"
"Approximation algorithms for the minimum rainbow subgraph problem Stephan Matos Camacho, Ingo Schiermeyer , Zsolt Tuza, Technische Universitt Bergakademie Freiberg, Germany a We consider the Minimum Rainbow Subgraph problem (MRS): Given a graph G, wh"
"Guideposts in the Cyclic Towers of Hanoi Problem John W. Emert Roger B. Nelson* Ball State University Frank W. Owens The multiple towers of Hanoi puzzle with a directed cycle transition graph is a variation of the classic 3-post towers of Hanoi puzz"
"Uniformly k-limited packings Bert Hartnell, Saint Marys University, Canada A k-limited packing in a graph, which generalizes a packing in a graph, is a set of vertices S such that no vertex in the graph has more than k members of S in its closed neig"
"d-Strong Edge Colorings of Graphs Arnfried Kemnitz , Massimiliano Marangio, Techn. Univ. Braunschweig, Germany If c : E {1, 2, . . . , k} is a proper edge coloring of a graph G = (V, E) then the palette S(v) of a vertex v V is the set of colors of "
"Discrepancy of Homogeneous Arithmetic Progressions Robert Hochberg, East Carolina University In the 1930s, Paul Erds asked if there was some constant B and a 2-coloring of the natural o numbers so that every finite arithmetic progression containing z"
"Minimum Distortion Embeddings into a Line Pinar Heggernes and Daniel Meister, University of Bergen, Andrzej Proskurowski , University of Oregon The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced "
"The Maximum Rectilinear Crossing Number of the n Dimensional Cube Graph, Qn Matthew Alpert (Harvard University), Elie Feder* (Kingsborough Community College-CUNY), Heiko Harborth (Technische Universitaet) and Sheldon Klein* (Rambam Mesivta High Schoo"
"Coloring of Distance Graphs Megan Ingraham , Hiren Maharaj, Clemson University A long standing problem is to determine the chromatic number of the unit distance graph on the Euclidean plane. The continuing search for bounds on this chromatic number h"
"Randi Index and Extremal Cacti c Daniel Gray , Hua Wang, Georgia Southern University A cactus is a connected graph with each block being an edge or a cycle. The Randi index of c a graph G is the sum of (d(u)(d(v) over all edges uv of G, where d(v) d"
"Diameter of Star Graphs with many Faults Eddie Cheng, Drew Lipman , Oakland University. An important issue in computer communication networks is fault-tolerant routing. Given a graph H and a set of faults F V (H) such that H F is connected, a routi"
"The competition number of a graph G with exactly one maximal clique of size 3 JungYeun Lee (Seoul National University), Seog-Jin Kim(Konkuk University) Suh-Ryung Kim(Seoul National University), Yoshio Sano(Kyoto University) Given a digraph D, its com"
"CHAPTER 14: COST ALLOCATION, CUSTOMER-PROFITABILITY ANALYSIS, AND SALES-VARIANCE ANALYSIS TRUE/FALSE 1. Indirect costs are costs that cannot be traced to cost objects in an economically feasible way. Answer: 2. True Difficulty: 1 Objective: 1 To mot"
"CHAPTER 17: PROCESS COSTING SYSTEMS TRUE/FALSE 1. Examples of industries that would use process costing include the pharmaceutical and semiconductor industry. Answer: 2. True Difficulty: 1 Objective: 1 The principal difference between process costin"
"CHAPTER 18: SPOILAGE, REWORKED UNITS, AND SCRAP TRUE/FALSE 1. Reducing defects helps to reduce costs, but does not make the business more competitive. Answer: False Difficulty: 2 Reducing defects does make the business more competitive. 2. Objective:"
"CHAPTER 9: INVENTORY COSTING AND CAPACITY ANALYSIS TRUE/FALSE 1. Absorption costing absorbs only variable manufacturing costs. Answer: False Difficulty: 1 Objective: 1 Absorption costing absorbs all manufacturing costs, both fixed and variable. 2. Va"
"CHAPTER 10: DETERMINING HOW COSTS BEHAVE TRUE/FALSE 1. One assumption frequently made in cost behavior estimation is that changes in total costs can be explained by changes in the level of a single activity. Answer: 2. True Difficulty: 1 Objective: 1"
"CHAPTER 6: MASTER BUDGET AND RESPONSIBILITY ACCOUNTING TRUE/FALSE 1. Few businesses plan to fail, but many of those that flop have failed to plan. Answer: 2. True Difficulty: 1 Objective: 1 The master budget reflects the impact of operating decision"