Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem
Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem
Fuente:
Wiley Open Access
Saved in:
Bibliographic Details
Main Authors:
Yingli Ran
,
Jianhong Jin
,
Zhao Zhang
Format:
Artículo Open Access
Published:
Wiley
2024
Subjects:
Networks
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Be the first to leave a comment!
Your Comment
You must be logged in first
Similar Items
Compact Mixed Integer Programming Formulations for the Minimum Biclique Cover Problem
by: Bruno Burin, et al.
Published: (2025)
Tractable but Hard to Approximate: The Bi‐Objective Minimum s‐t‐Cut Problem With Binary Capacities
by: Jan Boeckmann, et al.
Published: (2026)
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
by: Nour ElHouda Tellache, et al.
Published: (2025)
The Minimum Clique Routing Problem on Cycles
by: M. Escalante, et al.
Published: (2025)
Approximation Algorithms for Minimum Sum of Moving-Distance and Opening-Costs Target Coverage Problem
by: Zhao, Lei, et al.
Published: (2024)
