453 search results - page 1 / 91 » On Approximation of Bookmark Assignments |
MFCS
2007
Springer
14 years 5 months ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
EKAW
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Tagging has been widely used and studied in various domains. Recently, people-tagging has emerged as a means to categorize contacts, and is also used in some social acces...
JDWM
2010
13 years 9 months ago
2010
Social networks and collaborative tagging systems are rapidly gaining popularity as a primary means for storing and sharing data among friends, family, colleagues, or perfect stra...
IPL
2006
13 years 11 months ago
2006
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...
STOC
2002
ACM
14 years 11 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...