Sciweavers

12519 search results - page 81 / 2504
» Approximation Problems Categories
Sort
View
APPROX
2009
Springer
145views Algorithms» more  APPROX 2009»
16 years 24 days ago
Approximating Some Network Design Problems with Node Costs
We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in w...
Guy Kortsarz, Zeev Nutov
ALGORITHMICA
2005
99views more  ALGORITHMICA 2005»
15 years 6 months ago
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
Marek Karpinski, Ion I. Mandoiu, Alexander Olshevs...
EOR
2006
120views more  EOR 2006»
15 years 6 months ago
Approximate and exact algorithms for the fixed-charge knapsack problem
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
Umit Akinc
EMNLP
2006
15 years 7 months ago
Solving the Problem of Cascading Errors: Approximate Bayesian Inference for Linguistic Annotation Pipelines
The end-to-end performance of natural language processing systems for compound tasks, such as question answering and textual entailment, is often hampered by use of a greedy 1-bes...
Jenny Rose Finkel, Christopher D. Manning, Andrew ...
FSTTCS
2006
Springer
15 years 9 months ago
Approximation Algorithms for 2-Stage Stochastic Optimization Problems
Abstract. Stochastic optimization is a leading approach to model optimization problems in which there is uncertainty in the input data, whether from measurement noise or an inabili...
Chaitanya Swamy, David B. Shmoys