Gandhi, Rajiv 1969
Overview
Works:  3 works in 3 publications in 1 language and 4 library holdings 

Roles:  Author 
Classifications:  QA76.M3, 
Publication Timeline
.
Most widely held works by
Rajiv Gandhi
Broadcast scheduling by
Rajiv Gandhi(
)
1 edition published in 2003 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2003 in English and held by 2 WorldCat member libraries worldwide
Approximation algorithms for partial covering problems by
Rajiv Gandhi(
Book
)
1 edition published in 2001 in English and held by 1 WorldCat member library worldwide
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard covering problems. For example, in kset cover, we wish to choose a minimum number of sets to cover at least k elements. For kset cover, if each element occurs in at most f sets, then we derive a primaldual fapproximation algorithm (thus implying a 2approximation for kvertex cover) in polynomial time. In addition to its simplicity, this algorithm has the advantage of being parallelizable. For instances where each set has cardinality at most three, we obtain an approximation of 4/3. We also present better than 2approximation algorithms for kvertex cover on bounded degree graphs, and for vertex cover on expanders of bounded average degree. We obtain a polynomialtime approximation scheme for kvertex cover on planar graphs, and for covering points in Rd̂ by disks
1 edition published in 2001 in English and held by 1 WorldCat member library worldwide
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard covering problems. For example, in kset cover, we wish to choose a minimum number of sets to cover at least k elements. For kset cover, if each element occurs in at most f sets, then we derive a primaldual fapproximation algorithm (thus implying a 2approximation for kvertex cover) in polynomial time. In addition to its simplicity, this algorithm has the advantage of being parallelizable. For instances where each set has cardinality at most three, we obtain an approximation of 4/3. We also present better than 2approximation algorithms for kvertex cover on bounded degree graphs, and for vertex cover on expanders of bounded average degree. We obtain a polynomialtime approximation scheme for kvertex cover on planar graphs, and for covering points in Rd̂ by disks
Domain name based visualization of web histories in a zoomable user interface(
Book
)
1 edition published in 2000 in English and held by 1 WorldCat member library worldwide
Users of hypertext systems like the World Wide Web (WWW) often find themselves following hypertext links deeper and deeper, only to find themselves "lost" and unable to find their way back to the previously visited pages. We have implemented a web browser companion called Domain Tree Browser (DTB) that builds a tree structured visual navigation history while browsing the web. The Domain Tree Browser organizes the URLs visited based on the domain name of each URL and shows thumbnails of each page in a zoomable window. A usability test was conducted with four subjects
1 edition published in 2000 in English and held by 1 WorldCat member library worldwide
Users of hypertext systems like the World Wide Web (WWW) often find themselves following hypertext links deeper and deeper, only to find themselves "lost" and unable to find their way back to the previously visited pages. We have implemented a web browser companion called Domain Tree Browser (DTB) that builds a tree structured visual navigation history while browsing the web. The Domain Tree Browser organizes the URLs visited based on the domain name of each URL and shows thumbnails of each page in a zoomable window. A usability test was conducted with four subjects
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Associated Subjects
Languages