1647 search results - page 82 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
181
Voted
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
144
click to vote
EOR
2007
15 years 4 months ago
2007
In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This ...
133
click to vote
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
150
Voted
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...
135
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...