arbiter
JournalsPricingAccount

NOTE ON POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR INTEGRATED NETWORK DESIGN AND SCHEDULING PROBLEMS

Katsuyuki Miura et al.

Journal of the Operations Research Society of Japan2024https://doi.org/10.15807/jorsj.67.111article
ABDC B
Weight
0.30

What the paper says

In the integrated network design and scheduling (INDS) problem, we are asked to repair edges in a graph by using parallel machines so that the performance of the network is recovered by a certain level, and the objective is to minimize the makespan required to finish repairing edges. The main aim of this note is to show that polynomial-time approximation schemes exist for various families of the INDS problems with a constant number of parallel machines, including the problems associated with minimum spanning tree, shortest path, maximum edge-disjoint paths, and maximum-weight matching.

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.15807/jorsj.67.111

Or copy a formatted citation

@article{katsuyuki2024,
  title        = {{NOTE ON POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR INTEGRATED NETWORK DESIGN AND SCHEDULING PROBLEMS}},
  author       = {Katsuyuki Miura et al.},
  journal      = {Journal of the Operations Research Society of Japan},
  year         = {2024},
  doi          = {https://doi.org/https://doi.org/10.15807/jorsj.67.111},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

NOTE ON POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR INTEGRATED NETWORK DESIGN AND SCHEDULING PROBLEMS

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.30

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.00 × 0.4 = 0.00
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.