<--- Back to Details
First PageDocument Content
Search algorithms / Approximation algorithms / Mathematical optimization / NP-complete problems / Analysis of algorithms / Nearest neighbor search / Clique problem / K-nearest neighbor algorithm / Time complexity / Theoretical computer science / Mathematics / Applied mathematics
Date: 2013-08-12 15:35:49
Search algorithms
Approximation algorithms
Mathematical optimization
NP-complete problems
Analysis of algorithms
Nearest neighbor search
Clique problem
K-nearest neighbor algorithm
Time complexity
Theoretical computer science
Mathematics
Applied mathematics

LNCSCircle of Friend Query in Geo-Social Networks

Add to Reading List

Source URL: www.cse.unt.edu

Download Document from Source Website

File Size: 363,41 KB

Share Document on Facebook

Similar Documents

Game theory / Permutation / Price of anarchy / Shapley value / Approximation algorithm / Mathematics / Microeconomics / Mathematical economics

Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling Ioannis Caragiannis1 , Vasilis Gkatzelis2 , and Cosimo Vinci3 1 University of Patras, Rion-Patras, Greece

DocID: 1xTKO - View Document

Approximation algorithms An algorithm has approximation ratio r if it outputs solutions with cost such that c/c* ≤ r and c*/c ≤ r where c* is the optimal cost.

DocID: 1vcdB - View Document

Greedy approximation algorithms for dire ted multi uts Yana Kortsarts Guy Kortsarz Widener University

DocID: 1uQsZ - View Document

Fixed-Parameter and Approximation Algorithms: A New Look Rajesh Chitnis ∗ MohammadTaghi Hajiaghayi∗ Guy Kortsarz†

DocID: 1uPZi - View Document

Approximation Algorithms for Network Design Problems with Node Weights C. Chekuri∗ M. T. Hajiaghayi†

DocID: 1uLSz - View Document