On the public citation graph

The Complexity of File Transfer Scheduling with Forwarding

https://doi.org/10.1137/0219015

0 signed · 27 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01762116openalex-snapshot

Data transfers in networks

inferredcites →https://doi.org/10.1016/0020-0190(76)90053-3openalex-snapshot

Scheduling of unit-length independent tasks with execution constraints

inferredcites →https://doi.org/10.1016/0196-6774(82)90030-xopenalex-snapshot

Complexity results for scheduling tasks with discrete starting times

inferredcites →https://doi.org/10.1109/tcom.1982.1095433openalex-snapshot

An Optimal Switching Algorithm for Multibeam Satellite Systems with Variable Bandwidth Beams

inferredcites →https://doi.org/10.1137/0205048openalex-snapshot

On the Complexity of Timetable and Multicommodity Flow Problems

inferredcites →https://doi.org/10.1137/0210018openalex-snapshot

Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines

inferredcites →https://doi.org/10.1137/0214054openalex-snapshot

Scheduling File Transfers

inferredcites →https://doi.org/10.1137/0216013openalex-snapshot

Scheduling File Transfers for Trees and Odd Cycles

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.3230220606openalex-snapshot

Scheduling file transfers in fully connected networks

inferred← citeshttps://doi.org/10.1006/jagm.2001.1169openalex-snapshot

How Helpers Hasten h-Relations

inferred← citeshttps://doi.org/10.1006/jpdc.1996.0057openalex-snapshot

On-Line Routing of Real-Time Messages

inferred← citeshttps://doi.org/10.1006/jpdc.1998.1500openalex-snapshot

Complexity and Approximations for Multimessage Multicasting

inferred← citeshttps://doi.org/10.1007/3-540-36136-7_39openalex-snapshot

File Transfer Tree Problems

inferred← citeshttps://doi.org/10.1007/3-540-54945-5_48openalex-snapshot

Scheduling file transfers under port and channel constraints

inferred← citeshttps://doi.org/10.1007/978-3-030-69244-5_22openalex-snapshot

A New Integer Programming Model for the File Transfer Scheduling Problem

inferred← citeshttps://doi.org/10.1007/bfb0030112openalex-snapshot

Multi-Message Multicasting

inferred← citeshttps://doi.org/10.1007/s004530010072openalex-snapshot

Simple Algorithms for Multimessage Multicasting with Forwarding

inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00217-5openalex-snapshot

On the complexity of coordinated display of multimedia objects

inferred← citeshttps://doi.org/10.1109/hicss.1997.667217openalex-snapshot

Multimessage multicasting: complexity and approximations

inferred← citeshttps://doi.org/10.1109/iccnc.2019.8685610openalex-snapshot

Data Migration in Large Scale Heterogeneous Storage Systems with Nodes to Spare

inferred← citeshttps://doi.org/10.1109/icdcs.2011.46openalex-snapshot

Data Migration in Heterogeneous Storage Systems

inferred← citeshttps://doi.org/10.1109/tpds.2007.70801openalex-snapshot

Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode

inferred← citeshttps://doi.org/10.1142/s0129054101000874openalex-snapshot

ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS

inferred← citeshttps://doi.org/10.1142/s0129626409000110openalex-snapshot

Improved Communication Schedules with Buffers

inferred← citeshttps://doi.org/10.1142/s0219265900000184openalex-snapshot

DISTRIBUTED ALGORITHM FOR MULTIMESSAGE MULTICASTING

inferred← citeshttps://doi.org/10.1145/3708597.3708609openalex-snapshot

Data Migration in Large Scale Storage Systems with Varying File Sizes

inferred← citeshttps://doi.org/10.1201/9781420011296.ch36openalex-snapshot

Message Dissemination Using Modern Communication Primitives

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.