Find link

language:

Find link is a tool written by Edward Betts.

searching for Covering problems 22 found (41 total)

Cancer Nursing (115 words) [view diff] exact match in snippet view article find links to article

Cancer Nursing is a bi-monthly peer-reviewed nursing journal covering problems arising in the care and support of cancer patients from prevention and

Michael Christopher Wendl (1,148 words) [view diff] exact match in snippet view article find links to article

flow, infinite disks, etc. Wendl examined a number of matching and covering problems in combinatorial probability, especially as these problems apply to

Pankaj K. Agarwal (494 words) [view diff] exact match in snippet view article find links to article

prior two, is split into two sections. The first, on packing and covering problems, includes topics such as Minkowski's theorem, sphere packing, the

Tree spanner (463 words) [view diff] exact match in snippet view article find links to article

Kortsarz, Guy (2000), "Tree spanners for subgraphs and related tree covering problems", Graph-Theoretic Concepts in Computer Science: 26th International

Nerode Prize (619 words) [view diff] exact match in snippet view article find links to article

design of fixed-parameter-tractable algorithms for domination and covering problems on graphs. 2016: Andreas Björklund for his paper Determinant Sums

Deryk Osthus (549 words) [view diff] exact match in snippet view article find links to article

received a grant for "Randomized approaches to combinatorial packing and covering problems." From January 2019 to the current date, he was given a grant for

Afghanistanism (1,652 words) [view diff] exact match in snippet view article find links to article

on happenings in remote corners of the world to the exclusion of covering problems closer to home." Jeff Simon, "A Great Day for Couric and CBS News"

Antoon Kolen (478 words) [view diff] exact match in snippet view article find links to article

Universiteit van Amsterdam, 1982. Kolen, Antoon WJ, and Arie Tamir. Covering problems. Econometric Institute, 1984. Articles, a selection: Brouwer, Andries

Strongly chordal graph (1,167 words) [view diff] case mismatch in snippet view article find links to article

ISBN 0-89871-432-X. Chang, G. J. (1982), K-domination and Graph Covering Problems, Ph.D. thesis, Cornell University. Dahlhaus, E.; Manuel, P. D.; Miller

Walter Carnielli (1,106 words) [view diff] exact match in snippet view article find links to article

2012 in Philosophy and Mathematics. W. A. Carnielli. On coloring and covering problems for rook domains, Discrete Mathematics 57 (1985), pp. 9–16. W. A.

Rectilinear polygon (1,577 words) [view diff] exact match in snippet view article find links to article

or squares. There are several types of decomposition problems: In covering problems, the goal is to find a smallest set of units (squares or rectangles)

Academy of Military Science (Russia) (521 words) [view diff] exact match in snippet view article

from space; development of the project concept of military reform, covering problems converting all defense structures of the state; study of the peculiarities

László Pyber (678 words) [view diff] case mismatch in snippet view article find links to article

Lovász and Gyula O.H. Katona with the thesis Extremal Structures and Covering Problems. In 2007, he was awarded the Academics Prize by the Hungarian Academy

Alan J. Hoffman (3,693 words) [view diff] exact match in snippet view article find links to article

provides a characterization on 0-1 matrices for which packing and covering problems can be solved through a greedy approach. It provides a unification

List of unsolved problems in mathematics (19,531 words) [view diff] exact match in snippet view article find links to article

MR 0277533. Bereg, Sergey; Dumitrescu, Adrian; Jiang, Minghui (2010), "On covering problems of Rado", Algorithmica, 57 (3): 538–561, doi:10.1007/s00453-009-9298-z

Quine–McCluskey algorithm (3,013 words) [view diff] exact match in snippet view article find links to article

methods.) (5 pages) Masek, William J. (1979). Some NP-complete set covering problems. unpublished. Czort, Sebastian Lukas Arne (1999). The complexity of

Steiner tree problem (4,365 words) [view diff] exact match in snippet view article find links to article

Marek; Zelikovsky, Alexander (1998). "Approximating dense cases of covering problems". Proceedings of the DIMACS Workshop on Network Design: Connectivity

Matroid partitioning (2,031 words) [view diff] exact match in snippet view article find links to article

those for matroid partitioning. The fractional set packing and set covering problems associated with a matroid (that is, assign a weight to each independent

Geometric separator (2,388 words) [view diff] exact match in snippet view article find links to article

algorithm to find a maximum independent set, as well as several related covering problems, in geometric graphs. The planar separator theorem may be proven by

Intersection number (graph theory) (4,266 words) [view diff] exact match in snippet view article

1137/0213005, MR 0731027 Hoover, D. N. (1992), "Complexity of graph covering problems for graphs of low degree", Journal of Combinatorial Mathematics and

Covering problem of Rado (745 words) [view diff] exact match in snippet view article find links to article

MR 0319053 Bereg, Sergey; Dumitrescu, Adrian; Jiang, Minghui (2010), "On covering problems of Rado", Algorithmica, 57 (3): 538–561, doi:10.1007/s00453-009-9298-z

List of Odd Squad episodes (1,266 words) [view diff] exact match in snippet view article find links to article

Oona (Olivia Presti) realize that Weird Tom's solutions are simply covering problems up, they call for backup from the previous agents, Olive (Dalila Bela)