Networks, ISSN 0028-3045, 09/2018, Volume 72, Issue 2, pp. 238 - 248

This article considers the node‐weighted Steiner tree (NWST) problem and the maximum‐weight connected subgraph (MWCS) problem, which have applications in the...

maximum weight connected subgraph | Steiner tree | fixed‐parameter tractable | node‐weighted Steiner tree | strong exponential time hypothesis | node-weighted Steiner tree | fixed-parameter tractable | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | maximum weight connected subgraph node-weighted Steiner tree | NETWORKS | Analysis | Algorithms | Enumeration | Tree enumeration | Graphs | Graph theory | Dynamic programming | Decision trees | Weight

maximum weight connected subgraph | Steiner tree | fixed‐parameter tractable | node‐weighted Steiner tree | strong exponential time hypothesis | node-weighted Steiner tree | fixed-parameter tractable | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | maximum weight connected subgraph node-weighted Steiner tree | NETWORKS | Analysis | Algorithms | Enumeration | Tree enumeration | Graphs | Graph theory | Dynamic programming | Decision trees | Weight

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

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

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

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

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

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

Computer Networks, ISSN 1389-1286, 10/2014, Volume 71, pp. 48 - 62

In this paper, we study a problem of designing a multi-hop wireless network for interconnecting sensors (hereafter called source nodes) to a Base Station (BS),...

Relay placement for wireless sensor networks | Wireless sensor networks | Node-weighted Steiner tree | Hop constrained Steiner tree | Design of multi-hop CSMA networks | QoS based design of wireless sensor networks | HOP CONSTRAINTS | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | COMPUTER SCIENCE, INFORMATION SYSTEMS | TELECOMMUNICATIONS | HEURISTICS | ENGINEERING, ELECTRICAL & ELECTRONIC | STEINER | Access control | Models | Algorithms | Sensors | Analysis | Shortest path algorithms | Studies | Network flow problem | Wireless networks | Quality of service | Optimization algorithms | Relay | Traffic flow | Mathematical analysis | Traffic engineering | Mathematical models | Quality of service architectures | Counting

Relay placement for wireless sensor networks | Wireless sensor networks | Node-weighted Steiner tree | Hop constrained Steiner tree | Design of multi-hop CSMA networks | QoS based design of wireless sensor networks | HOP CONSTRAINTS | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | COMPUTER SCIENCE, INFORMATION SYSTEMS | TELECOMMUNICATIONS | HEURISTICS | ENGINEERING, ELECTRICAL & ELECTRONIC | STEINER | Access control | Models | Algorithms | Sensors | Analysis | Shortest path algorithms | Studies | Network flow problem | Wireless networks | Quality of service | Optimization algorithms | Relay | Traffic flow | Mathematical analysis | Traffic engineering | Mathematical models | Quality of service architectures | Counting

Journal Article

8.
Approximation algorithms for node-weighted prize-collecting steiner tree problems on planar graphs

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

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

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

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

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

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

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

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

Approximation Algorithms | Inner-node Weighted Minimum Spanning Trees | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | COMPUTER SCIENCE, THEORY & METHODS | STEINER TREES

Journal Article

Networks, ISSN 0028-3045, 01/1998, Volume 31, Issue 1, pp. 11 - 17

In this paper, we study the Node Weighted Steiner Tree Problem (NSP). This problem is a generalization of the Steiner tree problem in the sense that vertex...

Lagrangean relaxation | prize‐collecting Steiner tree problem | Node Weighted Steiner tree problem | subgradient optimization | Subgradient optimization | Node weighted Steiner tree problem | Prize-collecting Steiner tree problem | TRAVELING SALESMAN PROBLEM | K ES COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | prize-collecting Steiner tree problem | ALGORITHM | node weighted Steiner tree problem | GRAPHS | Teknik och teknologier | TEKNIKVETENSKAP | Engineering and Technology | TECHNOLOGY

Lagrangean relaxation | prize‐collecting Steiner tree problem | Node Weighted Steiner tree problem | subgradient optimization | Subgradient optimization | Node weighted Steiner tree problem | Prize-collecting Steiner tree problem | TRAVELING SALESMAN PROBLEM | K ES COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | prize-collecting Steiner tree problem | ALGORITHM | node weighted Steiner tree problem | GRAPHS | Teknik och teknologier | TEKNIKVETENSKAP | Engineering and Technology | TECHNOLOGY

Journal Article

19.
Full Text
A branch‐and‐cut algorithm for solving generalized multiperiod Steiner problems in graphs

Networks, ISSN 0028-3045, 07/1998, Volume 31, Issue 4, pp. 273 - 282

Given is an undirected graph with positive or negative edge weights which represent a profit if an investment such as installing a gas pipe takes place in a...

Steiner problem in graphs | node‐weighted Steiner tree problem in graphs | integer programming | branch‐and‐cut | Integer programming | Branch-and-cut | Node-weighted steiner tree problem in graphs | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | branch-and-cut | node-weighted Steiner tree problem in graphs | FACETS | TREE PROBLEM

Steiner problem in graphs | node‐weighted Steiner tree problem in graphs | integer programming | branch‐and‐cut | Integer programming | Branch-and-cut | Node-weighted steiner tree problem in graphs | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | branch-and-cut | node-weighted Steiner tree problem in graphs | FACETS | TREE PROBLEM

Journal Article

IEEE Transactions on Mobile Computing, ISSN 1536-1233, 04/2006, Volume 5, Issue 4, pp. 377 - 387

A wireless ad hoc network consists of mobile nodes that are equipped with energy-limited batteries. As mobile nodes are battery-operated, an important issue in...

Energy consumption | Ad hoc networks | Batteries | Mobile ad hoc networks | Intelligent networks | Multicast algorithms | power awareness | minimum node-weighted Steiner tree problem | multicasting | Spread spectrum communication | Broadcasting | approximation algorithm | Approximation algorithms | Wireless communication network | Energy efficiency | energy consumption optimization | Minimum node-weighted steiner tree problem | Energy consumption optimization | Power awareness | Approximation algorithm | Multicasting | wireless communication network | WEIGHTED STEINER TREES | DESIGN | COMPUTER SCIENCE, INFORMATION SYSTEMS | TELECOMMUNICATIONS | ad hoc networks | broadcasting | Multicast | Trees | Wireless communication | Networks | Algorithms | Approximation | Power consumption | Mathematical analysis

Energy consumption | Ad hoc networks | Batteries | Mobile ad hoc networks | Intelligent networks | Multicast algorithms | power awareness | minimum node-weighted Steiner tree problem | multicasting | Spread spectrum communication | Broadcasting | approximation algorithm | Approximation algorithms | Wireless communication network | Energy efficiency | energy consumption optimization | Minimum node-weighted steiner tree problem | Energy consumption optimization | Power awareness | Approximation algorithm | Multicasting | wireless communication network | WEIGHTED STEINER TREES | DESIGN | COMPUTER SCIENCE, INFORMATION SYSTEMS | TELECOMMUNICATIONS | ad hoc networks | broadcasting | Multicast | Trees | Wireless communication | Networks | Algorithms | Approximation | Power consumption | Mathematical analysis

Journal Article

No results were found for your search.

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