OpenAlex
PricingAboutJobs
Log inGet started
Work

Scheduling Maintenance Jobs in Networks

HTML

Year: 2017
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Algorithms and Complexity
DOI: 10.1007/978-3-319-57586-5_3
Authors: Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke
Institutions: University of Jeddah, University of Houston, Technische Universität Darmstadt, University of Waterloo, University of Bremen, Technische Universität Berlin, Technische Universität Braunschweig, Technical University of Munich
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: maintenance scheduling, outages, transportation networks, telecommunications networks, path networks, preemption, NP-hardness, hardness of approximation, approximation algorithms, polynomial-time algorithms

Open Access status: closed
OpenAlex ID: W2584897526
FWCI: 0.789
Cites: 19
Cited by: 5
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security