English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A bicriteria approximation algorithm is presented for the unrooted travelingrepairman problem, realizing increased profit in return for increased speedupof repairman motion. The algorithm generalizes previous results from the casein which all time windows are the same length to the case in which theirlengths can range between l and 2. This analysis can extend to any range oftime window lengths, following our earlier techniques. This relationshipbetween repairman profit and speedup is applicable over a range of values thatis dependent on the cost of putting the input in an especially desirable form,involving what are called "trimmed windows." For time windows with lengthsbetween 1 and 2, the range of values for speedup $s$ for which our analysisholds is $1 \leq s \leq 6$. In this range, we establish an approximation ratiothat is constant for any specific value of $s$.

Speedup in the Traveling Repairman Problem with Constrained Time Windows