Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Sara Ahmadian"'
We study the problem of approximately counting cliques and near cliques in a graph, where the access to the graph is only available through crawling its vertices; thus typically seeing only a small portion of it. This model, known as the random walk
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::944a4c77cbbe7158ebdda1c7f3bab951
http://arxiv.org/abs/2212.03957
http://arxiv.org/abs/2212.03957
Autor:
Shahrzad Haddadan, Sara Ahmadian
Publikováno v:
IEEE BigData
Social networks have become an inseparable part of human life and processing them in an efficient m anner is a top priority in the study of networks. These networks are highly dynamic and they are growing incessantly. Inspired by the concept of triad
Publikováno v:
Mathematical Programming. 172:249-275
Cooperative matching games (Shapley and Shubik) and Network bargaining games (Kleinberg and Tardos) are games described by an undirected graph, where the vertices represent players. An important role in such games is played by stable graphs, that are
Publikováno v:
Personality and Individual Differences. 107:49-53
How did Donald Trump dominate his more experienced competitors in the primaries? We suspected the answer might lie in his communication style rather than his platform details. Hence, we analyzed the announcement speeches of the top nine Republican co
Publikováno v:
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining.
In this paper we consider clustering problems in which each point is endowed with a color. The goal is to cluster the points to minimize the classical clustering cost but with the additional constraint that no color is over-represented in any cluster
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783319334608
IPCO
IPCO
Cooperative matching games Shapley and Shubik and Network bargaining games Kleinberg and Tardos are games described by an undirected graph, where the vertices represent players. An important role in such games is played by stable graphs, that are gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::303eed43a4e33aa58de8d6eb7b74c0d2
https://doi.org/10.1007/978-3-319-33461-5_14
https://doi.org/10.1007/978-3-319-33461-5_14
Autor:
Mohammad R. Salavatipour, Zachary Friggstad, Amin Jorati, Sara Ahmadian, Babak Behsaz, Chaitanya Swamy
We consider a facility-location problem that abstracts settings where the cost of serving the clients assigned to a facility is incurred by the facility. Formally, we consider the minimum-load k-facility location (ML k FL) problem, which is defined a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0713ec31df400e33a1622c0422c23e4c
Publikováno v:
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
Autor:
Sara Ahmadian, Chaitanya Swamy
Publikováno v:
Approximation and Online Algorithms ISBN: 9783642380150
WAOA
WAOA
We consider the lower-bounded facility location (LBFL) problem, which is a generalization of uncapacitated facility location (UFL), where each open facility is required to serve a certain minimum amount of demand. The current best approximation ratio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2e286097b3d89809b9a807b0a024421
https://doi.org/10.1007/978-3-642-38016-7_21
https://doi.org/10.1007/978-3-642-38016-7_21