Filters








5,170 Hits in 5.4 sec

Integer programming approach for directed minimum spanning tree problem on temporal graphs

Takuto Ikuta, Takuya Akiba
2016 Proceedings of the 1st ACM SIGMOD Workshop on Network Data Analytics - NDA '16  
In this paper, we explore the minimum-weight spanning tree problem on temporal graphs, which was recently proposed by Huang et al. [SIGMOD 2015].  ...  Even the most fundamental problems for static graphs become nontrivial for temporal graphs.  ...  Integer Linear Programming Formulation for Minimum Directed Spanning Tree We explain the integer linear programming formulation for the directed minimum spanning tree problem on temporal graphs.  ... 
doi:10.1145/2980523.2980528 dblp:conf/sigmod/IkutaA16 fatcat:2mra2dfpsfejbld5a6znj6c7ta

Page 1970 of Mathematical Reviews Vol. , Issue 2001C [page]

2001 Mathematical Reviews  
The author has found a new approach to the problem of finding minimum cuts in weighted and unweighted, directed and undi- rected graphs. The approach involves the use of spanning trees.  ...  We also show in this pa- per that for type Y Petri nets, the model checking problem for a number of temporal logics is reducible to the integer linear pro- gramming problem, yielding an NP upper bound  ... 

Reconstructing Evolving Tree Structures in Time Lapse Sequences

Przemyslaw Glowacki, Miguel Amavel Pinheiro, Engin Turetken, Raphael Sznitman, Daniel Lebrecht, Jan Kybic, Anthony Holtmaat, Pascal Fua
2014 2014 IEEE Conference on Computer Vision and Pattern Recognition  
We show that this problem can be formulated as a Quadratic Mixed Integer Program and solved efficiently.  ...  Instead of reconstructing structures in each image independently, we do so for all images simultaneously to take advantage of temporal-consistency constraints.  ...  This last step can be done using Minimum Spanning Trees (MST) [6, 26, 28] , Shortest Path Trees (SPT) [19] , k-Minimum Spanning Trees (k-MST) [25] , and Quadratic Mixed Integer Programming (QMIP) [  ... 
doi:10.1109/cvpr.2014.388 dblp:conf/cvpr/GlowackiPTSLKHF14 fatcat:o2ammsv7zrcfpgodfqsregiiju

Efficient Algorithm for Mining Frequent Subgraphs (Static and Dynamic) based on gSpan

K. Lakshmi, T. Meyyappan
2013 International Journal of Computer Applications  
We investigated new approaches for frequent graph-based pattern mining in graph datasets and found that a novel algorithm called span (graph-based Substructure pattern mining), has been used as the standard  ...  It is based on the pattern growth approach of frequent sub graph mining and hence discovers frequent substructures without candidate generation. span is based on a lexicographic order, and maps each graph  ...  and dynamic graphs (v) apply it for both directed and undirected graphs.  ... 
doi:10.5120/10572-3117 fatcat:7rzkwlxlrjfrldchmyayrso6s4

7. Combinatorial Parallel and Scientific Computing [chapter]

Ali Pınar, Bruce Hendrickson
2006 Parallel Processing for Scientific Computing  
New parallelization techniques for combinatorial algorithms need to be developed to support these nontraditional scientific approaches.  ...  Important, emerging areas of science are fundamentally discrete, and they are increasingly reliant on the power of parallel computing.  ...  One important abstraction for discrete problems is that of integer programming. A wide assortment of combinatorial optimization problems can be posed as integer programs.  ... 
doi:10.1137/1.9780898718133.ch7 fatcat:szr5t7calne2fbhkbkvwccrj6y

Discovering topically- and temporally-coherent events in interaction networks [article]

Han Xiao, Polina Rozenshtein, Aristides Gionis
2016 arXiv   pre-print
Finding the best temporal event leads to budget version of the prize-collecting Steiner-tree (PCST) problem, which we solve using three different methods: a greedy approach, a dynamic-programming algorithm  ...  We construct our model for detecting temporal events in two steps. We first introduce the notion of interaction meta-graph, which connects associated interactions.  ...  To incorporate temporal and topical coherence we set constraints on the time interval spanned by the event tree (temporal coherence), and on total weight of its edges (topical coherence).  ... 
arXiv:1606.09446v2 fatcat:yytdalgrwzajveh4qic7s65iey

Discovering Topically- and Temporally-Coherent Events in Interaction Networks [chapter]

Han Xiao, Polina Rozenshtein, Aristides Gionis
2016 Lecture Notes in Computer Science  
We show that this problem is the budget version of prize-collecting Steiner-tree problem in directed acyclic graphs. We provide three algorithms, among which a greedy approach performs the best.  ...  Finding the best temporal event leads to a budget version of the prize-collecting Steiner-tree (PCST) problem, which we solve using three different methods: a greedy approach, a dynamic-programming algorithm  ...  To incorporate temporal and topical coherence we set constraints on the time interval spanned by the event tree (temporal coherence), and on total weight of its edges (topical coherence).  ... 
doi:10.1007/978-3-319-46227-1_43 fatcat:3ub33dedk5ebhpmjxjpokzwdg4

As Time Goes By: Reflections on Treewidth for Temporal Graphs [chapter]

Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche
2020 Lecture Notes in Computer Science  
Triggered by a strongly growing interest in temporal networks (graphs where edge sets change over time), we discuss fresh algorithmic views on temporal tree decompositions and temporal treewidth.  ...  We review and explain some of the recent work together with some encountered pitfalls, and we point out challenges for future research.  ...  Mertzios for their constructive feedback which helped us to improve the presentation of the paper.  ... 
doi:10.1007/978-3-030-42071-0_6 fatcat:wutcqkgkbvb3jojzndezrti6ky

PURE: Scalable Phase Unwrapping with Spatial Redundant Arcs [article]

Ravi Lanka
2018 arXiv   pre-print
For a linear cost function, we propose a method based on Dual Decomposition that breaks the given problem defined over a non-planar graph into tractable sub-problems over planar subgraphs.  ...  However, this technique requires a commercial linear programming solver for large-scale problems.  ...  Acknowledgments We would like to thank Piyush Agram for introducing us to Phase Unwrapping and Redundant Arcs technique and for the numerous discussion that shaped the problem definition.  ... 
arXiv:1805.00321v2 fatcat:vbu2mzlg3jhmhdnsuplzbjf7ya

A Mixed Integer Programming Reformulation of the Mixed Fruit-Vegetable Crop Allocation Problem [chapter]

Sara Maqrot, Simon de Givry, Gauthier Quesnel, Marc Tchamitchian
2017 Lecture Notes in Computer Science  
First, we give a direct formulation as a binary quadratic program (BQP). Then we reformulate the problem using a Benders decomposition approach.  ...  This problem decomposition allows us to reformulate the MFVCAP into a Mixed Integer linear Program (MIP). The detailed spatial-temporal crop allocation plan is easy to obtain after solving the MIP.  ...  Problem (WCSP) formalism to solve the spatial-temporal crop allocation planning problem for a medium-size virtual farm.  ... 
doi:10.1007/978-3-319-60045-1_26 fatcat:4txco4c7ujblrhxzvjh6arqeym

Robust Scheduling of Task Graphs under Execution Time Uncertainty

Michele Lombardi, Michela Milano, Luca Benini
2013 IEEE transactions on computers  
The method has been tested on synthetic applications/platforms and compared with an off-line optimized Fixed Priority Scheduling (FPS) approach and a pure on-line FIFO scheduler; the results are very promising  ...  Our approach does not require probability distributions to be specified, relying instead on simple and cheaper-toobtain information (bounds, average values).  ...  PCP approaches usually rely on Simple Temporal Networks (STN, see [33] ) for temporal consistency check.  ... 
doi:10.1109/tc.2011.203 fatcat:ivdcvgwpp5cspo3u6ktdu5ryve

A Minimum-Labeling Approach for Reconstructing Protein Networks across Multiple Conditions [article]

Arnon Mazza, Irit Gat-Viks, Hesso Farhan, Roded Sharan
2013 arXiv   pre-print
Here we propose a novel formulation for network reconstruction from multiple-condition data and devise an efficient integer program solution for it.  ...  Despite intense work in this area, current algorithmic approaches are largely limited to analyzing a single screen and are, thus, unable to account for information on condition-specific genes, or reveal  ...  Safra Center for Bioinformatics at Tel Aviv University. RS was supported by a research grant from the Israel Science Foundation (grant no. 241/11).  ... 
arXiv:1307.7803v1 fatcat:zynjjwu7z5fdhcxps4fntjck5m

Comparing Advanced Graph-Theoretical Parameters of the Connectomes of the Lobes of the Human Brain [article]

Balazs Szalkai, Balint Varga, Vince Grolmusz
2017 arXiv   pre-print
Similar advantages in the deep graph connectivity properties are hold for the left frontal vs. the right frontal and for the right temporal vs. the left temporal lobes.  ...  for these, relatively small graphs of the brain.  ...  For a connected graph G T is a spanning tree of G if T contains all the vertices of G, and T is a tree subgraph of G. Clearly, all connected graphs contain at least one spanning tree.  ... 
arXiv:1709.04974v1 fatcat:xridocqaujfmfkponmxu3djtzi

Visual Analytics for Sets over Time and Space (Dagstuhl Seminar 19192)

Sara Irina Fabrikant, Silvia Miksch, Alexander Wolff, Michael Wagner
2019 Dagstuhl Reports  
space, and to begin working on these problems.  ...  This report documents the program and the outcomes of Dagstuhl Seminar 19192 "Visual Analytics for Sets over Time and Space", which brought together 29 researchers working on visualization (i) from a theoretical  ...  We thank Philipp Kindermann for collecting the self-introductory slides before the seminar and for assembling this report after the seminar.  ... 
doi:10.4230/dagrep.9.5.31 dblp:journals/dagstuhl-reports/FabrikantM019 fatcat:ng3ajyjdbrhdhmb7xiiigohsde

A Minimum-Labeling Approach for Reconstructing Protein Networks across Multiple Conditions [chapter]

Arnon Mazza, Irit Gat-Viks, Hesso Farhan, Roded Sharan
2013 Lecture Notes in Computer Science  
Results: We propose a novel formulation for the problem of network reconstruction from multiple-condition data and devise an efficient integer program solution for it.  ...  Despite intense work in this area, current algorithmic approaches are largely limited to analyzing a single screen and are, thus, unable to account for information on condition-specific genes, or reveal  ...  Safra Center for Bioinformatics at Tel Aviv University. RS was supported by a research grant from the Israel Science Foundation (grant no. 241/11). Author details  ... 
doi:10.1007/978-3-642-40453-5_4 fatcat:njvclozp2jd2pmh5ihigifaepy
« Previous Showing results 1 — 15 out of 5,170 results