Sciweavers

2040 search results - page 97 / 408
» Approximate Expectation Maximization
Sort
View
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
15 years 1 months ago
Improved algorithms for orienteering and related problems
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
Chandra Chekuri, Nitish Korula, Martin Pál
SODA
2004
ACM
82views Algorithms» more  SODA 2004»
15 years 1 months ago
On finding a guard that sees most and a shop that sells most
We present a near-quadratic time algorithm that computes a point inside a simple polygon P having approximately the largest visibility polygon inside P, and a nearlinear time algo...
Otfried Cheong, Alon Efrat, Sariel Har-Peled
DAM
2006
88views more  DAM 2006»
14 years 11 months ago
Domination analysis for minimum multiprocessor scheduling
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
Gregory Gutin, Tommy R. Jensen, Anders Yeo
JCO
2010
169views more  JCO 2010»
14 years 10 months ago
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
Shiyan Hu
CORR
2008
Springer
129views Education» more  CORR 2008»
14 years 11 months ago
On the Capacity of Wireless Multicast Networks
The problem of maximizing the average rate in a multicast network subject to a coverage constraint (minimum quality of service) is studied. Assuming the channel state information ...
Seyed Reza Mirghaderi, Alireza Bayesteh, Amir K. K...