Optimal greedy algorithms for indifference graphs
نویسندگان
چکیده
منابع مشابه
Greedy Algorithms for Optimal Distribution Approximation
The approximation of a discrete probability distribution t by an M -type distribution p is considered. The approximation error is measured by the informational divergence D(t‖p), which is an appropriate measure, e.g., in the context of data compression. Properties of the optimal approximation are derived and bounds on the approximation error are presented, which are asymptotically tight. It is ...
متن کاملEfficient Optimal Greedy Algorithms for Room Allocation
In this paper we address the problem of allocating rooms among people in a suitable topology of corridor with some contraints of undesired neighborhood. People are partitioned into families, and we consider both internal crashes (sharing a room with someone belonging to a different family), and external crashes (being in a room next to, or in front of someone belonging to a different family). T...
متن کاملGreedy algorithms for tracking mobile users in special mobility graphs
An important issue in wireless networks is the design and analysis of strategies for tracking mobile users. Several strategies have been proposed that aim at balancing the cost of updating the user position and the cost of locating a mobile user. The recently proposed reporting center strategy partitions the cellular network into reporting and non-reporting cells, and associates with each repor...
متن کاملGreedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the minimum vertex cover (MVC), minimum independent dominating set (MIDS) and minimum edge dominating set (MEDS) problems. In almost all cases we are able to improve the best known results for these problems. Results for t...
متن کاملGreedy stochastic algorithms for entropy-regularized optimal transport problems
Optimal transport (OT) distances are finding evermore applications in machine learning and computer vision, but their wide spread use in larger-scale problems is impeded by their high computational cost. In this work we develop a family of fast and practical stochastic algorithms for solving the optimal transport problem with an entropic penalization. This work extends the recently developed Gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1993
ISSN: 0898-1221
DOI: 10.1016/0898-1221(93)90308-i