Home
Introduction
Benchmarks
Overview of LDBC Benchmarks
Graphalytics Benchmark
Semantic Publishing Benchmark
Social Network Benchmark
Financial Benchmark
Developer Community
Fair Use Policies
GQL Community
Overview
Membership
Organizational Members
Becoming a Member
Posts
Events
Publications
Publications
Home
Publications
Fast approximation of Steiner trees in large graphs
Authors:
Andrey Gubichev and Thomas Neumann
Publication venue:
CIKM
Publication year:
2012
BIB
DOI
URL
« Back to Publications
×
