@inproceedings{e2e75309dde8401e909e473f9032277c,
title = "Node selection in large networks",
abstract = "A node selection query returns a set of network nodes that optimize some objective function. The problem of enabling fast and accurate node selection is of high importance in fields such as logistics, service planning, and advertising. Due to the computational complexity, it is often impossible to provide an optimal solution to particular node selection queries. We study new approximation methods for node selection in million-node networks, such as social and road networks. We extend existing models to a more realistic scenarios by introducing time and uncertainty into the problem domain, and we apply the proposed solutions to real-world datasets.",
keywords = "Graph, Node Selection, Optimization",
author = "Alvis Logins",
year = "2018",
month = oct,
day = "24",
doi = "10.1109/ICDE.2018.00216",
language = "English",
isbn = "978-1-5386-5521-4",
series = "Proceedings of the International Conference on Data Engineering",
publisher = "IEEE",
pages = "1689--1693",
booktitle = "Proceedings - IEEE 34th International Conference on Data Engineering, ICDE 2018",
address = "United States",
note = "34th IEEE International Conference on Data Engineering, ICDE 2018 ; Conference date: 16-04-2018 Through 19-04-2018",
}