Given a weighted directed graph G=(V,A), the minimum feedback arc set problem consists of finding a minimum weight set of arcs A'A such that the direc...
In an old weighing puzzle, there are n3 coins that are identical in appearance. All the coins except one have the same weight, and that counterfeit on...
Branching programs are a well-established computation model for Boolean functions, especially read-once branching programs (BP1s) have been studied in...
Motivated by the problem of supporting energy-efficient broadcasting in ad hoc wireless networks, we study the Minimum Energy Consumption Broadcast Su...
