WebThe latest tweets from @chopinmorgan WebMorgan Chopin: Optimization problems with propagation in graphs : Parameterized complexity and approximation. (Problèmes d'optimisation avec propagation dans les …

3 "Morgan Chopin" profiles LinkedIn

WebIn this paper, we consider the problem of maximizing the spread of influence through a social network. Here, we are given a graph G = (V,E), a positive integer k and a threshold value thr(v) attached to each vertex v ∈ V.The objective is then to find a subset of k vertices to “activate” such that the number of activated vertices at the end of a propagation … WebCiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): In this paper, we address the problem of finding good quality elimination orders for triangulating dynamic Bayesian networks. In Bilmes and Bartels (2003), the authors proposed a model and an algorithm to compute such orders, but in exponential time. We show that this can be done … hearsay then existing physical condition

Atelier Morgane Chouin

WebTarget Set Selection, which is a prominent NP-hard problem occurring in social network analysis and distributed computing, is notoriously hard both in terms of achieving useful approximation as well as fixed-parameter algorithms.The task is to select a minimum number of vertices into a “target set” such that all other vertices will become active in … WebCristina Bazgan, Morgan Chopin To cite this version: Cristina Bazgan, Morgan Chopin. The Robust Set Problem: Parameterized Complexity and Approx-imation. 37th International Symposium on Mathematical Foundations of Computer Science MFCS 2012, Aug 2012, Bratislava, Slovakia. pp.136-147, ￿10.1007/978-3-642-32589-2_15￿. ￿hal-01505586￿ WebPlay Morgane Chopin and discover followers on SoundCloud Stream tracks, albums, playlists on desktop and mobile. hearsay truth of the matter asserted examples