6740 search results - page 363 / 1348 » An s -Hamiltonian Line Graph Problem |
170
click to vote
FSTTCS
1993
Springer
15 years 8 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
139
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
140
click to vote
MP
2010
15 years 2 months ago
2010
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
127
click to vote
NETWORKS
2010
15 years 2 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
159
click to vote
COLOGNETWENTE
2010
15 years 1 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...