Publications related to Kruskal's algorithm

Reduced Numerical Approximation of Reduced Fluid-Structure Interaction Problems With Applications in Hemodynamics

This paper deals with fast simulations of the hemodynamics in large arteries by considering a reduced model of the associated fluid-structure interaction problem, which in turn allows an additional reduction in terms of the numerical discretisation. The re ...

2018

Iterative-Interpolated DFT for Synchrophasor Estimation: A Single Algorithm for P- and M-Class Compliant PMUs

Mario Paolone, Asja Derviskadic, Paolo Romano

We present a single synchrophasor estimation (SE) algorithm that is simultaneously compliant with both P and M phasor measurement unit (PMU) performance classes. The method, called iterative-interpolated discrete Fourier transform (i-IpDFT), iteratively es ...

2018

Coupled Atomistics and Discrete Dislocations in 3d (CADD-3d)

Jean-François Molinari, William Curtin, Guillaume Anciaux, Till Junge, Jaehyun Cho, Max Ludwig Hodapp

Capturing plasticity at realistic dislocation densities with high configurational complexity requires a continuum-leveldiscrete dislocation dynamics (DDD) description. However, many features controlling dislocation motion areinherently atomistic, such as t ...

2018

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic, Slobodan Mitrovic

We study the problem of maximizing a monotone submodular function subject to a cardinality constraint

k

, with the added twist that a number of items

\tau

from the returned set may be removed. We focus on the worst-case setting considered in Orlin et al ...

2017

Spinner: Scalable Graph Partitioning in the Cloud

Andreas Loukas, Dionysios Logothetis

In this paper, we present a graph partitioning algorithm to partition graphs with trillions of edges. To achieve such scale, our solution leverages the vertex-centric Pregel abstraction provided by Giraph, a system for large-scale graph analytics. We desig ...

Ieee2017

Information Structure Design in Team Decision Problems

Maryam Kamgarpour, Tyler Summers

We consider a problem of information structure design in team decision problems and team games. We propose simple, scalable greedy algorithms for adding a set of extra information links to optimize team performance and resilience to non-cooperative and adv ...

2017

Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature

Justin Dean Ward

We design new approximation algorithms for the problems of optimizing submodular and supermodular functions subject to a single matroid constraint. Specifically, we consider the case in which we wish to maximize a monotone increasing submodular function or ...

INFORMS2017

MINLP model and two-stage algorithm for the simultaneous synthesis of heat exchanger networks, utility systems and heat recovery cycles

François Maréchal, Alberto Mian, Emanuele Martelli

This work proposes a novel approach for the simultaneous synthesis of Heat Exchanger Networks (HEN) and Utility Systems of chemical processes and energy systems. Given a set of hot and cold process streams and a set of available utility systems, the method ...

2017

General Proximal Gradient Method: A Case for Non-Euclidean Norms

Volkan Cevher, Ya-Ping Hsieh, Marwa El Halabi, Cong Bang Vu, Van Quang Nguyen

In this paper, we consider composite convex minimization problems. We advocate the merit of considering Generalized Proximal gradient Methods (GPM) where the norm employed is not Euclidean. To that end, we show the tractability of the general proximity ope ...

2017

Maximizing k-Submodular Functions and Beyond

Justin Dean Ward

We consider the maximization problem in the value oracle model of functions defined on k-tuples of sets that are submodular in every orthant and r-wise monotone, where k >= 2 and 1

Assoc Computing Machinery2016

Kruskal's algorithm

Graph Chatbot

Chat with Graph Search

Reduced Numerical Approximation of Reduced Fluid-Structure Interaction Problems With Applications in Hemodynamics

Iterative-Interpolated DFT for Synchrophasor Estimation: A Single Algorithm for P- and M-Class Compliant PMUs

Coupled Atomistics and Discrete Dislocations in 3d (CADD-3d)

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Spinner: Scalable Graph Partitioning in the Cloud

Information Structure Design in Team Decision Problems

Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature

MINLP model and two-stage algorithm for the simultaneous synthesis of heat exchanger networks, utility systems and heat recovery cycles

General Proximal Gradient Method: A Case for Non-Euclidean Norms

Maximizing k-Submodular Functions and Beyond

Information Structure Design in Team Decision Problems

General Proximal Gradient Method: A Case for Non-Euclidean Norms

Coupled Atomistics and Discrete Dislocations in 3d (CADD-3d)

Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature

Spinner: Scalable Graph Partitioning in the Cloud

Maximizing k-Submodular Functions and Beyond

Iterative-Interpolated DFT for Synchrophasor Estimation: A Single Algorithm for P- and M-Class Compliant PMUs

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Reduced Numerical Approximation of Reduced Fluid-Structure Interaction Problems With Applications in Hemodynamics

MINLP model and two-stage algorithm for the simultaneous synthesis of heat exchanger networks, utility systems and heat recovery cycles