Sciweavers

7150 search results - page 89 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
WADS
2007
Springer
184views Algorithms» more  WADS 2007»
15 years 6 months ago
A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanj...
JCSS
2010
155views more  JCSS 2010»
14 years 11 months ago
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization ...
Michael Dom, Jiong Guo, Rolf Niedermeier
IPCO
2001
184views Optimization» more  IPCO 2001»
15 years 2 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
97
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
Approximation Algorithms for Data Broadcast in Wireless Networks
—Broadcasting is a fundamental operation in wireless networks and plays an important role in the communication protocol design. In multihop wireless networks, however, interferen...
Rajiv Gandhi, Yoo-Ah Kim, Seungjoon Lee, Jiho Ryu,...
ICC
2008
IEEE
130views Communications» more  ICC 2008»
15 years 7 months ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi