X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
algorithms (8) 8
node-weighted steiner tree (8) 8
approximation algorithms (7) 7
computer science, theory & methods (7) 7
mathematics, applied (6) 6
approximation algorithm (5) 5
computer science, hardware & architecture (5) 5
trees (5) 5
computer science (4) 4
graphs (4) 4
algorithm (3) 3
analysis (3) 3
approximation (3) 3
mathematical analysis (3) 3
network design (3) 3
operations research & management science (3) 3
theoretical computer science (3) 3
competitive analysis (2) 2
computer science, information systems (2) 2
dynamic programming (2) 2
integer programming (2) 2
mathematical models (2) 2
networks (2) 2
node weighted steiner tree problem (2) 2
node-weighted connectivity (2) 2
online algorithms (2) 2
planar graphs (2) 2
polynomial-time approximation scheme (2) 2
primal-dual algorithm (2) 2
steiner connectivity (2) 2
steiner tree (2) 2
steiner trees (2) 2
studies (2) 2
telecommunications (2) 2
tree problem (2) 2
access control (1) 1
ad hoc networks (1) 1
batteries (1) 1
branch and cut (1) 1
branch-and-bound (1) 1
branch-and-cut (1) 1
branch‐and‐cut (1) 1
broadcasting (1) 1
budgeted steiner tree (1) 1
combinatorial approximation algorithms (1) 1
computational theory and mathematics (1) 1
computer science applications (1) 1
computer science, interdisciplinary applications (1) 1
connected set cover (1) 1
counting (1) 1
covering steiner tree problem (1) 1
decision trees (1) 1
design (1) 1
design of multi-hop csma networks (1) 1
digital data networks (1) 1
disks (1) 1
dynamische programmierung (1) 1
energy consumption (1) 1
energy consumption optimization (1) 1
energy efficiency (1) 1
engineering and technology (1) 1
engineering, electrical & electronic (1) 1
enumeration (1) 1
facets (1) 1
facility location (1) 1
fixed-parameter tractable (1) 1
fixed‐parameter tractable (1) 1
generalized steiner tree (1) 1
graph theory (1) 1
group steiner tree (1) 1
heuristics (1) 1
hop constrained steiner tree (1) 1
hop constraints (1) 1
information systems (1) 1
inner-node weighted minimum spanning trees (1) 1
intelligent networks (1) 1
joining (1) 1
k es computer science, hardware & architecture (1) 1
knapsack constraint (1) 1
knapsack problem (1) 1
konkurrenzanalyse (1) 1
lagrangean multiplier preserving (1) 1
lagrangean relaxation (1) 1
lmp (1) 1
maximum node degrees (1) 1
maximum weight connected subgraph (1) 1
maximum weight connected subgraph node-weighted steiner tree (1) 1
minimum cost network under a given topology (1) 1
minimum node-weighted steiner tree problem (1) 1
minimum weighted connected dominating set (1) 1
minimum-weighted chromatic disk cover (1) 1
minimum-weighted connected dominating set (1) 1
minimum-weighted dominating set (1) 1
mobile ad hoc networks (1) 1
models (1) 1
multicast (1) 1
multicast algorithms (1) 1
multicasting (1) 1
network flow problem (1) 1
node weighted group steiner tree (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


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
SIAM Journal on Computing, ISSN 0097-5397, 2018, Volume 47, Issue 4, pp. 1275 - 1293
Moss and Rabani study constrained node-weighted Steiner tree problems with two independent weight values associated with each node, namely, cost and prize (or... 
Budgeted Steiner tree | Approximation algorithms | Network design | Steiner connectivity | Node-weighted connectivity | budgeted Steiner tree | MATHEMATICS, APPLIED | TREES | node-weighted connectivity | RELAXATION | COMPUTER SCIENCE, THEORY & METHODS | approximation algorithms | network design
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 2009, Volume 18, Issue 4, pp. 342 - 349
Given a graph G=(V,E) with node weight w:V -> R (+) and a subset SaS dagger V, find a minimum total weight tree interconnecting all nodes in S. This is the... 
Approximation algorithm | Unit disk graphs | Node-weighted Steiner tree | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | ALGORITHM
Journal Article
SIAM Journal on Computing, ISSN 0097-5397, 2017, Volume 46, Issue 3, pp. 911 - 935
We give the first polynomial-time online algorithm for the node-weighted Steiner forest problem with a poly-logarithmic competitive ratio. The competitive... 
Online algorithms | Network design | Steiner connectivity | Competitive analysis | Node-weighted connectivity | MATHEMATICS, APPLIED | APPROXIMATION ALGORITHMS | TREES | node-weighted connectivity | COMPUTER SCIENCE, THEORY & METHODS | network design | online algorithms | competitive analysis
Journal Article
SIAM Journal on Computing, ISSN 0097-5397, 2007, Volume 37, Issue 2, pp. 460 - 481
We consider a class of optimization problems where the input is an undirected graph with two weight functions defined for each node, namely the node's profit... 
Combinatorial approximation algorithms | Network design | Node-weighted problems | combinatorial approximation algorithms | MATHEMATICS, APPLIED | FACILITY LOCATION | node-weighted problems | COMPUTER SCIENCE, THEORY & METHODS | network design
Journal Article
Leibniz International Proceedings in Informatics, LIPIcs, ISSN 1868-8969, 06/2016, Volume 53, pp. 2.1 - 2.14
Conference Proceeding
Information and Computation, ISSN 0890-5401, 01/2013, Volume 222, pp. 293 - 306
Node-Weighted Steiner Forest is the following problem: Given an undirected graph, a set of pairs of terminal vertices, a weight function on the vertices, find... 
Vertex feedback set | Approximation algorithms | Primal-dual algorithm | Node-Weighted Steiner Forest | Generalized Steiner Tree | Planar graphs | MATHEMATICS, APPLIED | COMPUTER SCIENCE, THEORY & METHODS | TREE PROBLEM | Analysis | Algorithms
Journal Article
by Xu, X and Wang, Y and Du, H and Wan, P.-J and Zou, F and Li, X and Wu, W
Optimization Letters, ISSN 1862-4472, 2010, Volume 4, Issue 3, pp. 405 - 416
Given a node-weighted connected graph and a subset of terminals, the problem node-weighted Steiner tree (NWST) seeks a lightest tree connecting a given set of... 
Approximation algorithm | Unit-disk graph | Node-weighted Steiner tree | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHM
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2018, Volume 10979, pp. 214 - 223
Conference Proceeding
Theoretical Computer Science, ISSN 0304-3975, 2011, Volume 412, Issue 3, pp. 198 - 208
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2009, Volume 5573, pp. 36 - 48
Conference Proceeding
Asia-Pacific Journal of Operational Research, ISSN 0217-5959, 06/2008, Volume 25, Issue 3, pp. 373 - 391
The Knapsack Node Weighted Steiner Tree Problem (KNWSTP) is a generalization of the Steiner Tree Problem on graphs, which takes into account the classical cost... 
Relax and cut algorithm | Knapsack constraint | Node weighted steiner tree problem | relax and cut algorithm | knapsack constraint | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | Node Weighted Steiner Tree Problem | GRAPHS | Algorithms | Studies | Integer programming | Mathematical models | Theory of constraints | Knapsack problem
Journal Article
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, ISSN 0272-5428, 2013, pp. 568 - 577
Conference Proceeding
INFORMS Journal on Computing, ISSN 1091-9856, 01/1996, Volume 8, Issue 3, pp. 194 - 201
This paper deals with a Steiner tree-star problem that is a special case of the degree constrained node-weighted Steiner tree problem. This problem arises in... 
Steiner trees | node-weighted Steiner tree | telecommunications networks | branch and cut | digital data networks | polyhedral structure | Polyhedral structure | Telecommunications networks | Node-weighted Steiner tree | Digital data networks | Branch and cut
Journal Article
Computer Systems Science and Engineering, ISSN 0267-6192, 05/2009, Volume 24, Issue 3, pp. 189 - 195
This paper addresses the Inner-node Weighted Minimum Spanning Tree Problem (IWMST), which asks for a spanning tree in a graph G = (V. E) (vertical bar V... 
Approximation Algorithms | Inner-node Weighted Minimum Spanning Trees | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | COMPUTER SCIENCE, THEORY & METHODS | STEINER TREES
Journal Article
Networks, ISSN 0028-3045, 07/1998, Volume 31, Issue 4, pp. 273 - 282
Journal Article
No results were found for your search.

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