1992, Annals of discrete mathematics, ISBN 044489098X, Volume 53., xi, 339

Book

IEEE Transactions on Information Theory, ISSN 0018-9448, 02/2011, Volume 57, Issue 2, pp. 1015 - 1030

The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node...

Steiner trees | Upper bound | Computational modeling | cut-set bound | Capacity | Receivers | Network coding | Encoding | function computation | information theory | throughput | Indexes | network coding | COMPUTER SCIENCE, INFORMATION SYSTEMS | ENGINEERING, ELECTRICAL & ELECTRONIC | Coding theory | Distributed processing (Computers) | Research | Analysis | Methods | Information theory | Studies | Networks | Messages | Coding | Computation | Mathematical analysis | Upper bounds | Mathematical models

Steiner trees | Upper bound | Computational modeling | cut-set bound | Capacity | Receivers | Network coding | Encoding | function computation | information theory | throughput | Indexes | network coding | COMPUTER SCIENCE, INFORMATION SYSTEMS | ENGINEERING, ELECTRICAL & ELECTRONIC | Coding theory | Distributed processing (Computers) | Research | Analysis | Methods | Information theory | Studies | Networks | Messages | Coding | Computation | Mathematical analysis | Upper bounds | Mathematical models

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

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

To achieve effective communication in ad hoc sensor networks, researchers have been working on finding a minimum connected dominating set (MCDS) as a virtual...

Maximum independent set (MIS) | Minimum connected dominating set (MCDS) | Steiner tree | Minimum spanning tree | Ad hoc sensor networks | ELECTROCHEMISTRY | CHEMISTRY, ANALYTICAL | minimum connected dominating set (MCDS) | INSTRUMENTS & INSTRUMENTATION | APPROXIMATION | maximum independent set (MIS) | ad hoc sensor networks | minimum spanning tree | CONSTRUCTION

Maximum independent set (MIS) | Minimum connected dominating set (MCDS) | Steiner tree | Minimum spanning tree | Ad hoc sensor networks | ELECTROCHEMISTRY | CHEMISTRY, ANALYTICAL | minimum connected dominating set (MCDS) | INSTRUMENTS & INSTRUMENTATION | APPROXIMATION | maximum independent set (MIS) | ad hoc sensor networks | minimum spanning tree | CONSTRUCTION

Journal Article

1995, Applied discrete mathematics and theoretical computer science, ISBN 9781880132135, Volume 3, 201

Book

Computational Geometry: Theory and Applications, ISSN 0925-7721, 03/2018, Volume 68, pp. 262 - 276

We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which are either...

Matroid intersection | Approximation | Set visualization | Minimum spanning tree | Colored point set | Computational Theory and Mathematics | Computer Science Applications | Computational Mathematics | Control and Optimization | Geometry and Topology | MATHEMATICS | MATHEMATICS, APPLIED | HYPERGRAPHS | STEINER MINIMAL-TREES | EULER DIAGRAMS | Computer science | Visualization (Computers) | Algorithms | 65D Numerical approximation and computational geometry | 55 Algebraic topology | 55U Applied homological algebra and category theory | Classificació AMS | 65 Numerical analysis | Geometria computacional | Anàlisi numèrica | Algebra, Homological | Numerical analysis | Geometria | Àlgebra homològica | Matemàtiques i estadística | Àrees temàtiques de la UPC

Matroid intersection | Approximation | Set visualization | Minimum spanning tree | Colored point set | Computational Theory and Mathematics | Computer Science Applications | Computational Mathematics | Control and Optimization | Geometry and Topology | MATHEMATICS | MATHEMATICS, APPLIED | HYPERGRAPHS | STEINER MINIMAL-TREES | EULER DIAGRAMS | Computer science | Visualization (Computers) | Algorithms | 65D Numerical approximation and computational geometry | 55 Algebraic topology | 55U Applied homological algebra and category theory | Classificació AMS | 65 Numerical analysis | Geometria computacional | Anàlisi numèrica | Algebra, Homological | Numerical analysis | Geometria | Àlgebra homològica | Matemàtiques i estadística | Àrees temàtiques de la UPC

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 2011, Volume 412, Issue 3, pp. 198 - 208

Given a node-weighted graph, the minimum-weighted dominating set ( MWDS) problem is to find a minimum-weighted vertex subset such that, for any vertex, it is...

Minimum-weighted connected dominating set | Minimum-weighted dominating set | Node-weighted Steiner tree | Minimum-weighted chromatic disk cover | Approximation algorithm | Polynomial-time approximation scheme | STEINER TREE PROBLEMS | COMPUTER SCIENCE, THEORY & METHODS | Trees | Algorithms | Approximation | Disks | Graphs | Joining | Dynamic programming | Terminals

Minimum-weighted connected dominating set | Minimum-weighted dominating set | Node-weighted Steiner tree | Minimum-weighted chromatic disk cover | Approximation algorithm | Polynomial-time approximation scheme | STEINER TREE PROBLEMS | COMPUTER SCIENCE, THEORY & METHODS | Trees | Algorithms | Approximation | Disks | Graphs | Joining | Dynamic programming | Terminals

Journal Article

Annals of the Institute of Statistical Mathematics, ISSN 0020-3157, 2/2018, Volume 70, Issue 1, pp. 1 - 38

We give a survey on fold-up derivatives, a notion which was introduced by Khmaladze (J Math Anal Appl 334:1055–1072, 2007) and extended by Khmaladze and Weil...

Normal cylinder | Fold-up derivatives | Statistics for Business/Economics/Mathematical Finance/Insurance | Generalized functions | Local Steiner formula | Set-valued mapping | Derivative set | Local point process | Statistics, general | Change-set problem | Infinitesimal image analysis | Statistics | GAUSSIAN APPROXIMATION | CONVEX-BODIES | POISSON | CALCULUS | LOCAL EMPIRICAL PROCESSES | EQUATIONS | STATISTICS & PROBABILITY | OF-FIT TESTS | CLOSED-SETS | BOUNDARIES | DIFFERENTIATION | Likelihood ratio | Theorems | Derivatives

Normal cylinder | Fold-up derivatives | Statistics for Business/Economics/Mathematical Finance/Insurance | Generalized functions | Local Steiner formula | Set-valued mapping | Derivative set | Local point process | Statistics, general | Change-set problem | Infinitesimal image analysis | Statistics | GAUSSIAN APPROXIMATION | CONVEX-BODIES | POISSON | CALCULUS | LOCAL EMPIRICAL PROCESSES | EQUATIONS | STATISTICS & PROBABILITY | OF-FIT TESTS | CLOSED-SETS | BOUNDARIES | DIFFERENTIATION | Likelihood ratio | Theorems | Derivatives

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

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

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

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

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

A decomposition of the blocks of an $$\textsf {STS}(v)$$ STS(v) into partial parallel classes of size m is equivalent to a Kirkman signal set $$\textsf...

Information and Communication, Circuits | Data Structures, Cryptology and Information Theory | Discrete Mathematics in Computer Science | Data Encryption | Kirkman signal sets | Coding and Information Theory | Partial parallel classes | 05B07 | Mathematics | Combinatorics | Steiner triple systems | MATHEMATICS, APPLIED | COMPUTER SCIENCE, THEORY & METHODS | TRIPLE-SYSTEMS

Information and Communication, Circuits | Data Structures, Cryptology and Information Theory | Discrete Mathematics in Computer Science | Data Encryption | Kirkman signal sets | Coding and Information Theory | Partial parallel classes | 05B07 | Mathematics | Combinatorics | Steiner triple systems | MATHEMATICS, APPLIED | COMPUTER SCIENCE, THEORY & METHODS | TRIPLE-SYSTEMS

Journal Article

Journal of Combinatorial Optimization, ISSN 1382-6905, 8/2012, Volume 24, Issue 2, pp. 131 - 146

We study the recently introduced Connected Feedback Vertex Set (CFVS) problem from the view-point of parameterized algorithms. CFVS is the connected variant of...

Steiner Tree | FPT algorithms | Mathematics | Theory of Computation | Parameterized algorithms | Dynamic programming over tree decompositions | Subexponential FPT algorithms | Optimization | Group Steiner Tree | Directed Steiner Out-Tree | Connected Feedback Vertex Set | Hardness of polynomial kernelization | Operations Research/Decision Theory | Convex and Discrete Geometry | Feedback Vertex Set | H-minor-free graphs | Mathematical Modeling and Industrial Mathematics | Combinatorics | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | Hardness | Algorithms

Steiner Tree | FPT algorithms | Mathematics | Theory of Computation | Parameterized algorithms | Dynamic programming over tree decompositions | Subexponential FPT algorithms | Optimization | Group Steiner Tree | Directed Steiner Out-Tree | Connected Feedback Vertex Set | Hardness of polynomial kernelization | Operations Research/Decision Theory | Convex and Discrete Geometry | Feedback Vertex Set | H-minor-free graphs | Mathematical Modeling and Industrial Mathematics | Combinatorics | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | Hardness | Algorithms

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

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

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

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

IEEE Transactions on Parallel and Distributed Systems, ISSN 1045-9219, 03/2010, Volume 21, Issue 3, pp. 292 - 302

A minimum connected dominating set (MCDS) is used as virtual backbone for efficient routing and broadcasting in ad hoc sensor networks. The minimum CDS problem...

Heuristic algorithms | routing backbone | Spine | Optimized production technology | Communication system control | Routing | Ad hoc networks | maximal independent set (MIS) | Connectors | Connected dominating set (CDS) | Steiner tree | Collaboration | Broadcasting | Approximation algorithms | Routing backbone | Maximal independent set (MIS) | APPROXIMATION ALGORITHMS | CONSTRUCTION | UNIT DISK GRAPHS | COMPUTER SCIENCE, THEORY & METHODS | WIRELESS NETWORKS | ENGINEERING, ELECTRICAL & ELECTRONIC | Heuristic programming | Usage | Distributed processing (Computers) | Design and construction | Analysis | Ad hoc networks (Computer networks) | Studies | Algorithms | Heuristic | Trees | Networks | Graphs | Computer networks | Sensors | Optimization

Heuristic algorithms | routing backbone | Spine | Optimized production technology | Communication system control | Routing | Ad hoc networks | maximal independent set (MIS) | Connectors | Connected dominating set (CDS) | Steiner tree | Collaboration | Broadcasting | Approximation algorithms | Routing backbone | Maximal independent set (MIS) | APPROXIMATION ALGORITHMS | CONSTRUCTION | UNIT DISK GRAPHS | COMPUTER SCIENCE, THEORY & METHODS | WIRELESS NETWORKS | ENGINEERING, ELECTRICAL & ELECTRONIC | Heuristic programming | Usage | Distributed processing (Computers) | Design and construction | Analysis | Ad hoc networks (Computer networks) | Studies | Algorithms | Heuristic | Trees | Networks | Graphs | Computer networks | Sensors | Optimization

Journal Article

Journal of Combinatorial Optimization, ISSN 1382-6905, 11/2017, Volume 34, Issue 4, pp. 1060 - 1083

Let G be a connected graph and k be a positive integer. A vertex subset D of G is a k-hop connected dominating set if the subgraph of G induced by D is...

k -Hop connected dominating set | Convex and Discrete Geometry | Operations Research/Decision Theory | Approximation algorithms | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | k -Disruptive separator | Combinatorics | Hardness | Optimization | k-Disruptive separator | k-Hop connected dominating set | MATHEMATICS, APPLIED | PERMUTATION GRAPHS | LINEAR-TIME ALGORITHM | UNIT DISK GRAPHS | VERTEX COVER | WIRELESS AD HOC | kappa-Hop connected dominating set | STEINER TREES | DISTANCE-HEREDITARY GRAPHS | MINIMAL SEPARATORS | DISTRIBUTED CONSTRUCTION | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | kappa-Disruptive separator | CHORDAL GRAPHS | Mechanical properties | Algorithms

k -Hop connected dominating set | Convex and Discrete Geometry | Operations Research/Decision Theory | Approximation algorithms | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | k -Disruptive separator | Combinatorics | Hardness | Optimization | k-Disruptive separator | k-Hop connected dominating set | MATHEMATICS, APPLIED | PERMUTATION GRAPHS | LINEAR-TIME ALGORITHM | UNIT DISK GRAPHS | VERTEX COVER | WIRELESS AD HOC | kappa-Hop connected dominating set | STEINER TREES | DISTANCE-HEREDITARY GRAPHS | MINIMAL SEPARATORS | DISTRIBUTED CONSTRUCTION | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | kappa-Disruptive separator | CHORDAL GRAPHS | Mechanical properties | Algorithms

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

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

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

No results were found for your search.

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