Street-level travel time estimation along with the temporal variations in patterns of travel times is an important component of traffic planning and operation in modern urban settings. In this work, we propose a scalable distributed-computing based …
Estimating temporal patterns in travel times along road segments in urban settings is of central importance to trac engineers and city planners. In this work, we propose a methodology to leverage coarse-grained and aggregated travel time data to …
In this work, we leverage the Uber movement dataset for the Los Angeles (LA) area where partial TAZ to TAZ (Traffic Analysis Zone) trip time data is available, to predict travel time patterns on the full TAZ to TAZ network. We first create a TAZ-TAZ …
We consider an assignment problem arising in Fermionic-swap based mapping of the one-body and two-body interaction terms in simulating time evolution of a sparse second-quantized electronic structure Hamiltonian on a quantum computer. Relative …
We explore the problem of sharing data that pertains to individuals with anonymity guarantees, where each user requires a desired level of privacy. We propose the first sharedmemory as well as distributed memory parallel algorithms for the adaptive …
We describe two new 3=2-approximation algorithms and a new 2-approximation algorithm for the minimum weight edge cover problem in graphs. We show that one of the 3=2-approximation algorithms, the Dual Cover algorithm, computes the lowest weight edge …
In most real-world networks, the nodes/vertices tend to be organized into tightly-knit modules known as communities or clusters, such that nodes within a community are more likely to be “related” to one another than they are to the rest of the …
Abstract—We describe a paradigm for designing parallel algorithms via approximation, and illustrate it on the b-EDGE COVER problem. A b-EDGE COVER of minimum weight in a graph is a subset C of its edges such that at least a specified number b(v) of …
We describe a 3/2-approximation algorithm, LSE, for computing a b-Edge Cover of minimum weight in a graph with weights on the edges. The b-Edge Cover problem is a generalization of the better-known Edge Cover problem in graphs, where the objective is …
b-MATCHING is a subset of edges M such that at most b(v) edges in M are incident on each vertex v, where b(v) is specified. We present a distributed-memory parallel algorithm, b-SUITOR, that computes a b-MATCHING with more than half the maximum …