Sciweavers

3019 search results - page 129 / 604
» Approximating the Domatic Number
Sort
View
154
Voted
EOR
2008
93views more  EOR 2008»
15 years 6 months ago
Approximate methods for convex minimization problems with series-parallel structure
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris R...
IPL
2006
115views more  IPL 2006»
15 years 6 months ago
Approximate maximum weight branchings
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
Amitabha Bagchi, Ankur Bhargava, Torsten Suel
165
Voted
EOR
2007
92views more  EOR 2007»
15 years 6 months ago
Planning and approximation models for delivery route based services with price-sensitive demands
Classical vehicle routing problems typically do not consider the impact of delivery price on the demand for delivery services. Existing models seek the minimum sum of tour lengths...
Joseph Geunes, Zuo-Jun Max Shen, Akin Emir
133
Voted
IPL
2007
99views more  IPL 2007»
15 years 6 months ago
Approximation algorithms for minimizing segments in radiation therapy
Intensity modulated radiation therapy (IMRT) is one of the most effective modalities for modern cancer treatment. The key to successful IMRT treatment hinges on the delivery of a...
Shuang Luan, Jared Saia, Maxwell Young
177
Voted
JOI
2007
99views more  JOI 2007»
15 years 6 months ago
Measuring quality of similarity functions in approximate data matching
This paper presents a method for assessing the quality of similarity functions. The scenario taken into account is that of approximate data matching, in which it is necessary to d...
Roberto da Silva, Raquel Kolitski Stasiu, Viviane ...