1040 search results - page 140 / 208 » Rounding algorithms for covering problems |
148
click to vote
SODA
2000
ACM
15 years 5 months ago
2000
ACM
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
130
click to vote
CPC
2006
15 years 4 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
137
click to vote
IJCGA
2000
15 years 4 months ago
2000
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...
141
Voted
ORDER
2007
15 years 3 months ago
2007
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
137
click to vote
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...