6740 search results - page 361 / 1348 » An s -Hamiltonian Line Graph Problem |
149
click to vote
ATMOS
2010
15 years 3 months ago
2010
In this paper we address a real world optimisation problem, the Rail Track Inspection Scheduling Problem (RTISP). This problem consists of scheduling network inspection tasks. The...
249
click to vote
DISOPT
2011
14 years 11 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
161
click to vote
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
132
click to vote
CRYPTO
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
118
click to vote
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...