Search Sciweavers | Sciweavers

2714 search results - page 36 / 543

» Approximation Schemes for Scheduling

151

click to vote

APPROX
2004
Springer

119views Algorithms» more APPROX 2004»

Approximation Schemes for Broadcasting in Heterogenous Networks

15 years 11 months ago

Download www.engr.uconn.edu

We study the problem of minimizing the broadcast time for a set of processors in a cluster, where processor has transmission time , which is the time taken to send a message to any...

Samir Khuller, Yoo Ah Kim, Gerhard J. Woeginger

claim paper

Read More »

123

click to vote

MFCS
2004
Springer

89views Theoretical Computer Science» more MFCS 2004»

Polynomial Time Approximation Schemes and Parameterized Complexity

15 years 11 months ago

Download faculty.cs.tamu.edu

Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia

claim paper

Read More »

124

click to vote

ICALP
2003
Springer

101views Programming Languages» more ICALP 2003»

Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem

15 years 11 months ago

Download publications.ias.edu

Sanjeev Arora, Kevin L. Chang

claim paper

Read More »

125

click to vote

FOCS
2000
IEEE

97views Theoretical Computer Science» more FOCS 2000»

Polynomial Time Approximation Schemes for Geometric k-Clustering

15 years 10 months ago

Download www.cs.ucla.edu

Rafail Ostrovsky, Yuval Rabani

claim paper

Read More »

124

click to vote

STOC
2000
ACM

122views Algorithms» more STOC 2000»

Polynomial-time approximation scheme for data broadcast

15 years 10 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers