Sciweavers

3874 search results - page 121 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
CIE
2005
Springer
14 years 12 months ago
Domain-Theoretic Formulation of Linear Boundary Value Problems
Abstract. We present a domain theoretic framework for obtaining exact solutions of linear boundary value problems. Based on the domain of compact real intervals, we show how to app...
Dirk Pattinson
MOR
2006
95views more  MOR 2006»
14 years 10 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
15 years 10 months ago
A constant-factor approximation for stochastic Steiner forest
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
Anupam Gupta, Amit Kumar
COR
2006
82views more  COR 2006»
14 years 10 months ago
Semidefinite programming based approaches to the break minimization problem
This paper considers the break minimization problem in sports timetabling. The problem is to find, under a given timetable of a round-robin tournament, a home-away assignment that...
Ryuhei Miyashiro, Tomomi Matsui
IPL
2008
95views more  IPL 2008»
14 years 10 months ago
The Generalized Maximum Coverage Problem
We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in w...
Reuven Cohen, Liran Katzir