Fast approximation of steiner trees in large graphs

No abstract is available for this paper.

• Publication year

  2012

• Venue

  International Conference on Information and Knowledge Management

• Publication date

  2012-10-29

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/2396761.2398460
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Predicting positive and negative links in online social networks

  2010cited by this paper
• A sketch-based distance oracle for web-scale graphs

  2010cited by this paper
• Fast and accurate estimation of shortest paths in large graphs

  2010cited by this paper
• Keyword Search in Relational Databases: A Survey

  2010cited by this paper
• STAR: Steiner-Tree Approximation in Relationship Graphs

  2009influential reference
• EASE: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data

  2008cited by this paper
• Measurement and analysis of online social networks

  2007cited by this paper
• BLINKS: ranked keyword searches on graphs

  2007influential reference
• Finding Top-k Min-Cost Connected Trees in Databases

  2007cited by this paper
• Bidirectional Expansion For Keyword Search on Graph Databases

  2005cited by this paper
• Keyword searching and browsing in databases using BANKS

  2002cited by this paper
• Approximate distance oracles

  2001cited by this paper
• A fast algorithm for Steiner trees

  1981cited by this paper
• Reducibility Among Combinatorial Problems

  1972cited by this paper
• The steiner problem in graphs

  1971cited by this paper
• On the Steiner Problem

  1967cited by this paper

• Minimum Steiner Tree Approximation for Extracting Unknown Information via Avoiding High-Centrality Nodes

  2024cites this paper
• Distributed approximate minimal Steiner trees with millions of seed vertices on billion-edge graphs

  2023cites this paper
• Towards Distributed 2-Approximation Steiner Minimal Trees in Billion-edge Graphs

  2022cites this paper
• Locating ballot drop boxes

  2022cites this paper
• The drop box location problem

  2022cites this paper
• Graph integration of structured, semistructured and unstructured data for data journalism

  2020cites this paper
• Keyword Search over Knowledge Graphs via Static and Dynamic Hub Labelings

  2020cites this paper
• Relationship search over knowledge graphs

  2020cites this paper
• Graph-based keyword search in heterogeneous data sources

  2020cites this paper
• Finding Minimum Connected Subgraphs With Ontology Exploration on Large RDF Data

  2020influential citation
• Knowledge-Based Sentiment Analysis and Visualization on Social Networks

  2020cites this paper
• Keyword Search in Heterogeneous Data Sources

  2020influential citation
• Solving the Steiner Tree Problem in Graphs using Physarum-inspired Algorithms

  2019cites this paper
• Community Focusing: Yet Another Query-Dependent Community Detection

  2019cites this paper
• Attribute-Driven Backbone Discovery

  2019cites this paper
• Classical, prize-collecting and node-weighted Steiner tree problems in graphs

  2018cites this paper
• Knowledge-based Identication of Emotional Status on Social Networks

  2018cites this paper
• Domain-Specific Modeling: A Food and Drink Gazetteer

  2017cites this paper
• Query Processing and Optimization in Graph Databases

  2015cites this paper
• Strong Steiner Tree Approximations in Practice

  2014cites this paper
• Graph-Based Business Process Model Refactoring

  2013cites this paper