We survey recent work on approximation algorithms for computing degree-constrained
subgraphs in graphs and their applications in combinatorial scientific computing. The …

More and more networks are becoming reconfigurable: not just the routing can be
programmed, but the physical layer itself as well. Various technologies enable this …

We describe a 3/2-approximation algorithm, LSE, for computing ab-Edge Cover of minimum
weight in a graph with weights on the edges. The b-Edge Cover problem is a generalization …

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 shared …

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 …

Disruptive innovations such as Big Data offer enormous benefits to organizations however
they usually come with a cost. Decision makers instinctively seek to adopt such innovative …

Matching nodes in a graph G=(V, E) is a well-studied algorithmic problem with many
applications. The b-matching problem is a generalizati on that allows to match a node with …

Packet scheduling over a switch (interconnect) fabric is a wellstudied problem in distributed
computing, with known near-optimal distributed bipartite matching based protocols. We …

A degree-constrained subgraph construction (DCS) problem aims to find an optimal
spanning subgraph (wrt an objective function) subject to certain degree constraints on the …

We present a new greedy b-MATCHING algorithm suitable for running on a GPU. Our
algorithm differs from previous efforts at designing parallel algorithms for this problem in that …