129
click to vote
SODA
2016
ACM
10 years 18 days ago
2016
ACM
We present an approximation algorithm for the maximum weight matroid intersection problem in the independence oracle model. Given two matroids defined over a common ground set N ...
121
click to vote
SODA
2016
ACM
10 years 18 days ago
2016
ACM
We study the d-dimensional vector bin packing problem, a well-studied generalization of bin packing arising in resource allocation and scheduling problems. Here we are given a set...
139
click to vote
SODA
2016
ACM
10 years 18 days ago
2016
ACM
We study the multiway cut problem in directed graphs and one of its special cases, the node-weighted multiway cut problem in undirected graphs. In DIRECTED MULTIWAY CUT (DIR-MC) t...