Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 31 matches
- 2023
- Luka Matijevic, Slobodan Jelic, Tatjana Davidovic:
General variable neighborhood search approach to group steiner tree problem. Optim. Lett. 17(9): 2087-2111 (2023) - Ke Zhang, Xiaoqing Wang, Gong Cheng:
Efficient Approximation Algorithms for the Diameter-Bounded Max-Coverage Group Steiner Tree Problem. WWW 2023: 199-209 - 2022
- Jiaxuan Zhang, Suogang Gao, Bo Hou, Wen Liu:
An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties. Comput. Appl. Math. 41(6) (2022) - Shuang Yang, Yahui Sun, Jiesong Liu, Xiaokui Xiao, Rong-Hua Li, Zhewei Wei:
Approximating Probabilistic Group Steiner Trees in Graphs. Proc. VLDB Endow. 16(2): 343-355 (2022) - Yifeng Zhou, Shichao Lin, Qi Zhao:
Steiner Tree-based Collaborative Learning Group Formation in Trust Networks. ICEIS (1) 2022: 243-250 - 2021
- Yahui Sun, Xiaokui Xiao, Bin Cui, Saman K. Halgamuge, Theodoros Lappas, Jun Luo:
Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights. Proc. VLDB Endow. 14(7): 1137-1149 (2021) - Yuxuan Shi, Gong Cheng, Trung-Kien Tran, Jie Tang, Evgeny Kharlamov:
Keyword-Based Knowledge Graph Exploration Based on Quadratic Group Steiner Trees. IJCAI 2021: 1555-1562 - 2020
- Guy Kortsarz, Zeev Nutov:
Bounded Degree Group Steiner Tree Problems. IWOCA 2020: 343-354 - 2019
- Guy Kortsarz, Zeev Nutov:
Bounded Degree Group Steiner Tree Problems. CoRR abs/1910.12848 (2019) - 2018
- Rebeka Coric, Mateja Dumic, Slobodan Jelic:
A genetic algorithm for Group Steiner Tree Problem. MIPRO 2018: 944-949 - 2017
- Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz:
Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs. SODA 2017: 737-751 - 2016
- Rong-Hua Li, Lu Qin, Jeffrey Xu Yu, Rui Mao:
Efficient and Progressive Group Steiner Tree Search. SIGMOD Conference 2016: 91-106 - MohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx:
A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting. STOC 2016: 570-583 - Lidong Wu, Huijuan Wang, Weili Wu:
Connected Set-Cover and Group Steiner Tree. Encyclopedia of Algorithms 2016: 430-432 - 2014
- Erik D. Demaine, Mohammad Taghi Hajiaghayi, Philip N. Klein:
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. ACM Trans. Algorithms 10(3): 13:1-13:20 (2014) - 2013
- Björn Zenker:
Approximation minimaler Steinerbäume in Straßennetzwerken zur Bestimmung von Treffbäumen für Gruppennavigationssysteme (Approximation of Steiner Minimal Trees in Street Networks for the Calculation of Meeting Trees for Group Navigation Systems). University of Erlangen-Nuremberg, Germany, 2013 - 2012
- Khaled M. Elbassioni, Slobodan Jelic, Domagoj Matijevic:
The relation of Connected Set Cover and Group Steiner Tree. Theor. Comput. Sci. 438: 96-101 (2012) - Tuhina Samanta, Raka Sardar, Hafizur Rahaman, Parthasarathi Dasgupta, Bhargab B. Bhattacharya:
A heuristic method for obstacle avoiding group Steiner tree construction. SLIP 2012: 21 - 2009
- Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip N. Klein:
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. ICALP (1) 2009: 328-340 - 2007
- Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang:
Integrality Ratio for Group Steiner Trees and Directed Steiner Trees. SIAM J. Comput. 36(5): 1494-1511 (2007) - Moonseong Kim, Minseok Kang, Hyunseung Choo, Jong S. Yang, Young-Cheol Bang:
On Efficiency Group Multicasting Algorithm with Multiple Minimum Steiner Trees. International Conference on Computational Science (3) 2007: 432-439 - 2006
- Carlos Eduardo Ferreira, Fernando Mário de Oliveira Filho:
Some formulations for the group steiner tree problem. Discret. Appl. Math. 154(13): 1877-1884 (2006) - Carlos Eduardo Ferreira, Fernando Mário de Oliveira Filho:
New Reduction Techniques for the Group Steiner Tree Problem. SIAM J. Optim. 17(4): 1176-1188 (2006) - 2004
- Carlos Eduardo Ferreira, Fernando Mário de Oliveira Filho:
Some Formulations for the Group Steiner Tree Problem. Electron. Notes Discret. Math. 18: 127-132 (2004) - 2003
- Martin Zachariasen, André Rohe:
Rectilinear group Steiner trees and applications in VLSI design. Math. Program. 94(2-3): 407-433 (2003) - Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang:
Integrality ratio for group Steiner trees and directed steiner trees. SODA 2003: 275-284 - 2000
- Naveen Garg, Goran Konjevod, R. Ravi:
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. J. Algorithms 37(1): 66-84 (2000) - Alexis Irlande, Jean-Claude König, Christian Laforest:
Construction of low-cost and low-diameter Steiner trees for multipoint groups. SIROCCO 2000: 197-210 - 1998
- Naveen Garg, Goran Konjevod, R. Ravi:
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. SODA 1998: 253-259 - Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha:
Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-Median. STOC 1998: 114-123
skipping 1 more match
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-19 08:37 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint