X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (1746) 1746
Conference Proceeding (335) 335
Publication (135) 135
Book / eBook (71) 71
Dissertation (53) 53
Magazine Article (43) 43
Book Chapter (39) 39
Book Review (38) 38
Newspaper Article (24) 24
Government Document (10) 10
Paper (9) 9
Trade Publication Article (2) 2
Report (1) 1
Transcript (1) 1
Web Resource (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (662) 662
mathematics, applied (469) 469
algorithms (420) 420
steiner tree (336) 336
steiner trees (332) 332
computer science (240) 240
optimization (215) 215
computer science, theory & methods (207) 207
combinatorics (195) 195
approximation algorithms (191) 191
graphs (184) 184
operations research & management science (176) 176
routing (172) 172
trees (163) 163
analysis (146) 146
networks (134) 134
engineering, electrical & electronic (124) 124
mathematical analysis (120) 120
algorithm (119) 119
studies (118) 118
computer science, hardware & architecture (115) 115
computer science, information systems (105) 105
theory of computation (102) 102
approximation algorithm (100) 100
computer science, software engineering (98) 98
steiner triple system (95) 95
graph theory (92) 92
telecommunications (91) 91
data structures, cryptology and information theory (90) 90
steiner triple-systems (89) 89
steiner tree problem (88) 88
steiner (87) 87
approximation (82) 82
theoretical computer science (80) 80
discrete mathematics and combinatorics (77) 77
steiner problem (77) 77
convex and discrete geometry (76) 76
mathematical models (76) 76
computer science, interdisciplinary applications (74) 74
network design (72) 72
research (70) 70
multicast (66) 66
construction (65) 65
steiner system (57) 57
steiner systems (57) 57
topology (57) 57
combinatorial analysis (55) 55
mathematics of computing (55) 55
steiner triple systems (55) 55
algorithm design and analysis (54) 54
operations research/decision theory (54) 54
geometry (53) 53
usage (52) 52
information and communication, circuits (50) 50
polynomials (50) 50
steiner point (48) 48
algorithm analysis and problem complexity (47) 47
steiner symmetrization (47) 47
mathematics, general (46) 46
applied mathematics (45) 45
designs (43) 43
design (42) 42
steiner points (42) 42
very large scale integration (42) 42
wireless networks (42) 42
computer networks (41) 41
index medicus (41) 41
operations research (41) 41
computational geometry (40) 40
delay (40) 40
computer systems organization and communication networks (39) 39
discrete mathematics in computer science (39) 39
integer programming (39) 39
connectivity (38) 38
costs (38) 38
heuristic (38) 38
heuristic algorithms (38) 38
mathematical modeling and industrial mathematics (38) 38
methods (38) 38
operation research/decision theory (38) 38
computer science, general (37) 37
large set (37) 37
computational theory and mathematics (36) 36
multicast routing (36) 36
statistics & probability (36) 36
wireless sensor networks (36) 36
combinatorial optimization (35) 35
decision trees (35) 35
mathematics - combinatorics (34) 34
steiner, george (34) 34
steiner, rudolf (34) 34
linear programming (33) 33
mathematical optimization (33) 33
artificial intelligence (32) 32
coding and information theory (32) 32
computation (32) 32
economics / management science (32) 32
05b05 (31) 31
computational mathematics and numerical analysis (31) 31
engineering design (31) 31
more...
Library Location Library Location
Library Location Library Location
X
Sort by Item Count (A-Z)
Filter by Count
Robarts - Stacks (22) 22
Mathematical Sciences - Stacks (11) 11
Collection Dvlpm't (Acquisitions) - Vendor file (9) 9
OISE - Stacks (8) 8
UTL at Downsview - May be requested (5) 5
Collection Dvlpm't (Acquisitions) - Closed Orders (4) 4
Gerstein Science - Stacks (4) 4
UofT at Scarborough - Stacks (4) 4
UofT at Mississauga - Stacks (3) 3
Victoria University E.J. Pratt - Stacks (3) 3
Architecture Landscape (Shore + Moffat) - Stacks (2) 2
Music - Stacks (2) 2
St. Michael's College (John M. Kelly) - 2nd Floor (2) 2
Collection Dvlpm't (Acquisitions) - Cancelled Order (1) 1
Knox College (Caven) - Storage (1) 1
OISE - Missing (1) 1
Online Resources - Online (1) 1
Pontifical Inst. Mediaeval Studies - Library use only (1) 1
St. Michael's College (John M. Kelly) - 3rd Floor (1) 1
Trinity College (John W Graham) - Stacks (1) 1
University College (Laidlaw) - Stacks (1) 1
Victoria University CRRS - Library use only (1) 1
more...
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (2225) 2225
German (25) 25
Chinese (12) 12
Japanese (9) 9
Korean (4) 4
French (3) 3
Spanish (3) 3
Italian (2) 2
Portuguese (2) 2
Arabic (1) 1
Croatian (1) 1
Latin (1) 1
Russian (1) 1
more...
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


IEEE Transactions on Information Theory, ISSN 0018-9448, 02/2011, Volume 57, Issue 2, pp. 1015 - 1030
Journal Article
Ad Hoc Networks, ISSN 1570-8705, 05/2016, Volume 42, pp. 61 - 73
In a wireless network, messages need to be sent on in an optimized way to preserve the energy of the network. A minimum connected dominating set (MCDS) offers... 
Wireless sensor networks | Connected Dominating Set (CDS) | Maximal independent set (MIS) | Steiner Tree | Unit disk graph (UDG) | ROTATION | CDS | ALGORITHM | DOMATIC PARTITION | COMPUTER SCIENCE, INFORMATION SYSTEMS | TREE | TELECOMMUNICATIONS | Computer science | Algorithms | Sensors | Networks | Construction | Messages | Approximation | Wireless networks | Complexity | Construction costs
Journal Article
Sensors (Switzerland), ISSN 1424-8220, 04/2019, Volume 19, Issue 8, p. 1919
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 2011, Volume 412, Issue 3, pp. 198 - 208
Journal Article
Annals of the Institute of Statistical Mathematics, ISSN 0020-3157, 2/2018, Volume 70, Issue 1, pp. 1 - 38
Journal Article
IEEE/ACM Transactions on Networking, ISSN 1063-6692, 1/2020, Volume 28, Issue 1, pp. 1 - 12
The problem of finding a minimum-weight connected dominating set (CDS) of a given undirected graph has been studied actively, motivated by operations of... 
polymatroid Steiner tree | Connected dominating set | adaptive optimization
Journal Article
Computer Networks, ISSN 1389-1286, 08/2017, Volume 123, pp. 137 - 152
In a Wireless Sensor Network (WSN), neither there is any fixed infrastructure nor any centralized control. Therefore, for efficient routing, some of the nodes... 
Maximal Independent Set (MIS) | Connected Dominating Set (CDS) | Unit Disk Graph (UDG) | Steiner Tree | Virtual Backbone | ROTATION | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | DOMATIC PARTITION | COMPUTER SCIENCE, INFORMATION SYSTEMS | ALGORITHMS | TELECOMMUNICATIONS | ENGINEERING, ELECTRICAL & ELECTRONIC | CDS
Journal Article
1992, Annals of discrete mathematics, ISBN 044489098X, Volume 53., xi, 339
Book
Journal of Combinatorial Theory, Series A, ISSN 0097-3165, 04/2017, Volume 147, pp. 155 - 185
In this article, three types of joins are introduced for subspaces of a vector space. Decompositions of the Graßmannian into joins are discussed. This... 
Halving | Large set | Combinatorial design | q-analog | Subspace design | FINITE-FIELDS | Q-ANALOGS | BINOMIAL COEFFICIENTS | REPEATED BLOCKS | GF(Q) | MATHEMATICS | NONTRIVIAL T-DESIGNS | 2-DESIGNS | STEINER | GEOMETRY
Journal Article
Designs, Codes and Cryptography, ISSN 0925-1022, 10/2018, Volume 86, Issue 10, pp. 2183 - 2195
Journal Article
Random Structures & Algorithms, ISSN 1042-9832, 03/2014, Volume 44, Issue 2, pp. 224 - 239
The independence number α(H) of a hypergraph H is the size of a largest set of vertices containing no edge of H. In this paper, we prove that if Hn is an... 
independent sets | hypergraphs | steiner systems | Hypergraphs | Steiner systems | Independent sets | NEIGHBORHOODS | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS | MATHEMATICS, APPLIED | NUMBER | TRIPLE-SYSTEMS | UNCROWDED HYPERGRAPHS | SPARSE GRAPHS | Algorithms | Graphs | Theorems | Shearers | Proving
Journal Article
PHILOSOPHICAL QUARTERLY, ISSN 0031-8094, 04/2019, Volume 69, Issue 275, pp. 221 - 234
Hillel Steiner argues that a necessary and sufficient condition for the compossibility of a set of rights is that those rights be extensionally differentiable.... 
compossibility | FUNDAMENTAL LEGAL CONCEPTIONS | PHILOSOPHY | rights | property | interference | intentional action | performability | Hillel Steiner
Journal Article
INFORMS Journal on Computing, ISSN 1091-9856, 09/2014, Volume 26, Issue 4, pp. 645 - 657
We present exact algorithms for solving the minimum connected dominating set problem in an undirected graph. The algorithms are based on two approaches: a... 
Valid inequalities | Benders decomposition | Branch and cut | Connected dominating sets | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | FORMULATIONS | valid inequalities | branch and cut | connected dominating sets | STEINER TREE PROBLEM
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 11/2018, Volume 38, Issue 4, pp. 947 - 962
Let = ( ) be a graph and ⊆ . We say that is a dominating set of , if each vertex in \ has a neighbor in . Moreover, we say that is a connected (respectively,... 
05C69 | dominating set | connected dominating set | independent set | Connected dominating set | Dominating set | Independent set | MATHEMATICS | APPROXIMATION ALGORITHMS | CHORDAL GRAPHS | STEINER TREES
Journal Article
Journal of Mathematical Analysis and Applications, ISSN 0022-247X, 05/2014, Volume 413, Issue 1, pp. 291 - 310
In recent work by Khmaladze and Weil (2008) and by Einmahl and Khmaladze (2011), limit theorems were established for local empirical processes near the... 
Normal cylinder | Bifurcation | Local point process | Local Steiner formula | Set-valued mapping | Derivative set | MATHEMATICS | MATHEMATICS, APPLIED | BOUNDARIES | CALCULUS | LOCAL EMPIRICAL PROCESSES | Computer science
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 06/2012, Volume 438, pp. 96 - 101
We report that the Connected Set Cover (CSC) problem is just a special case of the Group Steiner Tree (GST) problem. Based on that we obtain the first... 
Weighted connected set cover | Covering Steiner tree problem | Set cover | Node weighted group Steiner tree | Connected set cover | Group Steiner tree | COMPUTER SCIENCE, THEORY & METHODS | Algorithms | Trees | Approximation | Mathematical analysis
Journal Article