![]() ![]() To solve the SES problem, we design three efficient and scalable algorithms. We show that, even in highly restricted instances, the SES problem is NP-hard to be approximated over a factor. In this work, we study the Social Event Scheduling (SES) problem which aims at identifying and assigning social events to appropriate time slots, so that the number of events attendees is maximized. ![]() events, since the number of attendees has great impact on the event's expected gains (e.g., revenue, artist/brand publicity). Recent studies show that "attendance" is the most common metric used to capture the success of social. Social event planning has received a great deal of attention in recent years where various entities, such as event planners and marketing companies, organizations, venues, or users in Event-based Social Networks, organize numerous social events (e.g., festivals, conferences, promotion parties). ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |