X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (1755) 1755
Conference Proceeding (336) 336
Publication (136) 136
Dissertation (53) 53
Magazine Article (46) 46
Book Chapter (39) 39
Book Review (35) 35
Newspaper Article (30) 30
Book / eBook (28) 28
Government Document (10) 10
Paper (10) 10
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 (664) 664
mathematics, applied (471) 471
algorithms (421) 421
steiner tree (337) 337
steiner trees (333) 333
computer science (239) 239
optimization (215) 215
computer science, theory & methods (207) 207
approximation algorithms (193) 193
combinatorics (193) 193
graphs (181) 181
operations research & management science (178) 178
routing (172) 172
trees (161) 161
analysis (146) 146
networks (135) 135
engineering, electrical & electronic (123) 123
mathematical analysis (120) 120
algorithm (118) 118
computer science, hardware & architecture (118) 118
studies (116) 116
computer science, information systems (103) 103
theory of computation (103) 103
approximation algorithm (100) 100
computer science, software engineering (98) 98
steiner triple system (96) 96
graph theory (94) 94
data structures, cryptology and information theory (91) 91
telecommunications (90) 90
steiner tree problem (88) 88
steiner triple-systems (88) 88
approximation (84) 84
steiner (82) 82
theoretical computer science (80) 80
computer science, interdisciplinary applications (78) 78
discrete mathematics and combinatorics (77) 77
steiner problem (77) 77
convex and discrete geometry (76) 76
mathematical models (75) 75
network design (74) 74
research (70) 70
construction (64) 64
multicast (64) 64
topology (58) 58
steiner system (57) 57
steiner systems (57) 57
mathematics of computing (56) 56
algorithm design and analysis (54) 54
combinatorial analysis (54) 54
geometry (54) 54
operations research/decision theory (54) 54
steiner triple systems (54) 54
usage (51) 51
information and communication, circuits (50) 50
polynomials (50) 50
algorithm analysis and problem complexity (48) 48
steiner point (48) 48
steiner symmetrization (48) 48
applied mathematics (46) 46
mathematics, general (46) 46
computer networks (42) 42
design (42) 42
designs (42) 42
very large scale integration (42) 42
computational geometry (41) 41
index medicus (41) 41
steiner points (41) 41
computer systems organization and communication networks (40) 40
delay (40) 40
discrete mathematics in computer science (39) 39
heuristic algorithms (39) 39
integer programming (39) 39
wireless networks (39) 39
connectivity (38) 38
costs (38) 38
mathematical modeling and industrial mathematics (38) 38
methods (38) 38
operation research/decision theory (38) 38
operations research (38) 38
computer science, general (37) 37
decision trees (37) 37
heuristic (37) 37
large set (37) 37
computational theory and mathematics (36) 36
multicast routing (36) 36
statistics & probability (36) 36
combinatorial optimization (35) 35
wireless sensor networks (35) 35
linear programming (34) 34
mathematics - combinatorics (34) 34
coding and information theory (32) 32
complexity (32) 32
computation (32) 32
economics / management science (32) 32
mathematical optimization (32) 32
steiner, george (32) 32
05b05 (31) 31
computational mathematics and numerical analysis (31) 31
baumstruktur (30) 30
data encryption (30) 30
more...
Library Location Library Location
Library Location Library Location
X
Sort by Item Count (A-Z)
Filter by Count
Mathematical Sciences - Stacks (11) 11
Collection Dvlpm't (Acquisitions) - Vendor file (5) 5
Collection Dvlpm't (Acquisitions) - Closed Orders (4) 4
Gerstein Science - Stacks (3) 3
UofT at Scarborough - Stacks (2) 2
Online Resources - Online (1) 1
St. Michael's College (John M. Kelly) - 2nd Floor (1) 1
more...
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (2200) 2200
German (13) 13
Chinese (12) 12
Japanese (10) 10
Korean (4) 4
Spanish (3) 3
Portuguese (2) 2
Croatian (1) 1
Italian (1) 1
Russian (1) 1
more...
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Nonlinear Analysis, ISSN 0362-546X, 08/2020, Volume 197, p. 111842
We establish sufficient conditions for a function on the torus to be equal to its Steiner symmetrization and apply the result to so-called volume-constrained... 
Cahn–Hilliard | Steiner symmetrization | Bonnesen inequality | Two-point rearrangement
Journal Article
Journal of Computer and System Sciences, ISSN 0022-0000, 08/2020, Volume 111, pp. 22 - 41
A strict connection tree of a graph G for a set W is a tree subgraph of G whose leaf set equals W. The Strict terminal connection problem (S-TCP) is a network... 
Connection tree | Terminal vertices | Bounded degree | Steiner tree | Parameterized complexity
Journal Article
Journal of Combinatorial Designs, ISSN 1063-8539, 06/2020, Volume 28, Issue 6, pp. 428 - 444
It is known that in any r‐coloring of the edges of a complete r‐uniform hypergraph, there exists a spanning monochromatic component. Given a Steiner triple... 
Steiner triple system | Ramsey
Journal Article
Discrete Mathematics, ISSN 0012-365X, 06/2020, Volume 343, Issue 6, p. 111844
The p-rank of a Steiner quadruple system B is the dimension of the linear span of the set of characteristic vectors of blocks of B over GF(p). We derive a... 
Latin cube | 2-rank | Steiner quadruple system
Journal Article
Journal of Combinatorial Designs, ISSN 1063-8539, 04/2020, Volume 28, Issue 4, pp. 307 - 326
In 1977, D. Betten defined a geometric group to be a permutation group (G,Ω) such that G=Aut(R) for some hypergraph R on Ω. In this paper, we extend Betten's... 
hypergraph | overlarge set | affine design | geometric group of second order | Fano plane | geometric group | Steiner system | STRONGLY REGULAR GRAPHS | MATHEMATICS | SETS | COMPLEXITY | PARTITIONS
Journal Article
Networks, ISSN 0028-3045, 04/2020, Volume 75, Issue 3, pp. 310 - 320
For a given set X of points in the plane, we consider the problem of constructing a 2‐vertex‐connected network spanning X and at most k additional Steiner... 
2‐connectivity | geometric network | approximation algorithms | biconnected network | bottleneck Steiner network | fixed parameter tractability | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHMS | 2-connectivity | Optimization | Algorithms | Parameters
Journal Article
Journal of Combinatorial Designs, ISSN 1063-8539, 04/2020, Volume 28, Issue 4, pp. 327 - 343
A partial Steiner triple system of order n is sequenceable if there is a sequence of length n of its distinct points such that no proper segment of the... 
sequenceable | partial Steiner triple system | MATHEMATICS
Journal Article
Information Technology Newsweekly, ISSN 1944-1797, 03/2020, p. 5371
Newspaper Article
SOFT COMPUTING, ISSN 1432-7643, 03/2020, Volume 24, Issue 6, pp. 3943 - 3961
The Steiner minimal tree (SMT) problem is an NP-hard problem, which is the best connection model for a multi-terminal net in global routing problem. This paper... 
Hybrid transformation strategy | Self-adapting strategy | Octagonal steiner minimal tree | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | GLOBAL ROUTER | TREES | Unified algorithm | X-ARCHITECTURE | Particle swarm optimization | Rectilinear steiner minimal tree | COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Journal Article
Online Social Networks and Media, ISSN 2468-6964, 03/2020, Volume 16, p. 100062
People’s activities in Online Social Networks (OSNs) have generated a massive volume of data to which tremendous attention has been paid in academia and... 
Subgraph connectivity | Local view | Minimum steiner tree | Search | Online social networks
Journal Article
Journal Article
Networks, ISSN 0028-3045, 03/2020, Volume 75, Issue 2, pp. 124 - 136
We present a set of integer programs (IPs) for the Steiner tree problem with the property that the best solution obtained by solving all IPs provides an... 
independent subproblems | linear programming | integer programming | convex hull | Steiner tree | laminar family | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | RELAXATIONS | GRAPHS | Linear programming | Graphs | Polynomials | Terminals | Decision trees
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 02/2020, Volume 809, pp. 563 - 574
We study the minimum connected sensor cover problem (MIN-CSC) and the budgeted connected sensor cover (Budgeted-CSC) problem, both motivated by important... 
Hitting set | Computational geometry | Approximation algorithms | Sensor cover | Steiner tree | DOMINATING SET | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
IEEE Transactions on Big Data, ISSN 2332-7790, 2/2020, pp. 1 - 1
The ever-increasing popularity of web APIs allows app developers to leverage a set of existing APIs to achieve their sophisticated objectives. The heavily... 
Web APIs recommendation | Correlation | Buildings | Keyword search | Dynamic Programming | Steiner Tree | Speech recognition | Big Data | Synchronization | Task analysis | Interviews
Journal Article
IEEE/ACM Transactions on Networking, ISSN 1063-6692, 02/2020, Volume 28, Issue 1, pp. 387 - 398
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
JOURNAL OF COMBINATORIAL OPTIMIZATION, ISSN 1382-6905, 02/2020, Volume 39, Issue 2, pp. 457 - 491
The geometric delta-minimum spanning tree problem (delta-MST) is the problem of finding a minimum spanning tree for a set of points in a normed vector space,... 
Discrete geometry | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | STEINER MINIMAL-TREES | Approximation algorithms | Bounded degree | Combinatorial optimisation | Minimum spanning trees | Bottleneck objective | EUCLIDEAN TRAVELING SALESMAN
Journal Article
Frontiers of Computer Science, ISSN 2095-2228, 2/2020, Volume 14, Issue 1, pp. 130 - 145
Multicast transfer can efficiently save the bandwidth consumption and reduce the load on the source node than a series of independent unicast transfers.... 
Steiner tree | Computer Science | approximation algorithm | uncertain multicast | dynamic behaviors | routing forest | Computer Science, general | Military electronics industry | Algorithms | Analysis | Machine learning
Journal Article
IEEE Transactions on Parallel and Distributed Systems, ISSN 1045-9219, 02/2020, Volume 31, Issue 2, pp. 393 - 407
Journal Article
Applied Mathematical Modelling, ISSN 0307-904X, 02/2020, Volume 78, pp. 268 - 286
Journal Article
JOURNAL OF COMBINATORIAL OPTIMIZATION, ISSN 1382-6905, 02/2020, Volume 39, Issue 2, pp. 492 - 508
In this paper, we consider the 1-line Euclidean minimum Steiner tree problem, which is a variation of the Euclidean minimum Steiner tree problem and defined as... 
1-Line Euclidean minimum Steiner tree | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | Constrained Euclidean minimum Steiner tree | Steiner ratio | Approximation algorithms | Complexity
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.