1974 search results - page 75 / 395 » On Unbiased Linear Approximations |
106
click to vote
ANOR
2004
15 years 15 days ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
84
Voted
ICC
2009
IEEE
14 years 10 months ago
2009
IEEE
Abstract This paper proposes an analytical method to evaluate the delay violation probability of traffic flows with statistical Quality-of-Service (QoS) guarantees in a Generalize...
114
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
142
click to vote
MFCS
2005
Springer
15 years 6 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
85
Voted
DAM
2010
15 years 22 days ago
2010
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...