Pathria Anu

Anu Pathria

Information about the author Anu Pathria will soon be added to the site.
Found 4 papers in total
The bottleneck graph partition problem
The bottleneck graph partition problem
1996
The bottleneck graph partition problem is to partition the nodes of a graph into two...
Locating centers in a dynamically changing network, and related problems
Locating centers in a dynamically changing network, and related problems
1998
In a dynamically changing network, the costs or distances between locations are...
Analysis of the greedy approach in problems of maximum k-coverage
Analysis of the greedy approach in problems of maximum k-coverage
1998
In this paper, we consider a general covering problem in which k subsets are to be...
Generalized p-Center problems: Complexity results and approximation algorithms
Generalized p-Center problems: Complexity results and approximation algorithms
1997
In an earlier paper, two alternative p -Center problems, where the centers serving...
Papers per page: