Cover Image

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!

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)

On Constrained Minimum Weight Edge Covers With Applications to Emergency Planning
by: Shai Dimant, et al.
Published: (2024)

Long-range frustration in Minimal Vertex Cover Problem on random graphs
by: Li, Yu-Tao, et al.
Published: (2025)

Building Conformal Prediction Intervals with Approximate Message Passing
by: Clarté, Lucas, et al.
Published: (2024)

A Quantum Approximate Optimization Algorithm for Local Hamiltonian Problems
by: Kannan, Ishaan, et al.
Published: (2024)

Polylogarithmic Approximation for Covering and Connecting Multi-Interface Networks
by: Szyfelbein, Michał, et al.
Published: (2026)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
by: Wang, Chen, et al.
Published: (2024)

Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations
by: Marcel Jackiewicz, et al.
Published: (2024)

Scalable Approximate Biclique Counting over Large Bipartite Graphs
by: Chen, Jingbang, et al.
Published: (2025)

Scalable Algorithm for Dynamic Quasi-clique Detection
by: Chen, Jingbang, et al.
Published: (2026)

The Minimum‐Cost Dynamic Flow Problem in a Fixed Graph With a Constant Target Flow Value
by: Naoyuki Kamiyama
Published: (2025)

An Exact Algorithm for the Hazardous Orienteering Problem
by: Roberto Montemanni, et al.
Published: (2025)

A Simple 2-Approximation Algorithm For Minimum Manhattan Network Problem
by: Sanim, Md. Musfiqur Rahman, et al.
Published: (2024)

Minimum Sum Set Cover: Structures and Algorithm
by: Zhang, Zhongyi, et al.
Published: (2026)

A Note on the Largest Insertion Algorithm for the Traveling Salesman Problem
by: Dario Ostuni, et al.
Published: (2025)

Matheuristic Algorithms for the Inventory Routing Problem With Unsplit and Split Deliveries
by: Nho Minh Dinh, et al.
Published: (2025)

Generalized Probabilistic Approximate Optimization Algorithm
by: Abdelrahman, Abdelrahman S., et al.
Published: (2025)

Quantum Approximate Optimization Algorithm for Spatiotemporal Forecasting of HIV Clusters
by: Roosan, Don, et al.
Published: (2025)

An Efficient Streaming Algorithm for Approximating Graphlet Distributions
by: Bressan, Marco, et al.
Published: (2026)

Dynamic $((1+ε)\ln n)$-Approximation Algorithms for Minimum Set Cover and Dominating Set
by: Solomon, Shay, et al.
Published: (2023)

An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale
by: Spaeh, Fabian, et al.
Published: (2025)

Topology-Aware LLM-Driven Social Simulation: A Unified Framework for Efficient and Realistic Agent Dynamics
by: Xu, Yuwei, et al.
Published: (2026)

HiFIRec Towards High-Frequency yet Low-Intention Behaviors for Multi-Behavior Recommendation
by: Luo, Ruiqi, et al.
Published: (2025)

Efficient and Effective Algorithms for A Family of Influence Maximization Problems with A Matroid Constraint
by: Huang, Yiqian, et al.
Published: (2024)

Pseudodeterministic Algorithms for Minimum Cut Problems
by: Agarwala, Aryan, et al.
Published: (2025)

Minimum-Cost Sensor Channel Selection For Wearable Computing
by: Sah, Ramesh Kumar, et al.
Published: (2024)

Featured Cover
by: Pei Lyu, et al.
Published: (2025)

Approximate Realizations for Outerplanaric Degree Sequences
by: Bar-Noy, Amotz, et al.
Published: (2024)

Parameterized Algorithms for Minimum Sum Vertex Cover
by: Aute, Shubhada, et al.
Published: (2024)

Biomolecular LQR under Partial Observation
by: Zhang, Xiaoyu, et al.
Published: (2025)

Branch‐and‐Bound Algorithms for the K$$ K $$‐Cluster Problem Based on SDP Bounds Evaluated by Lagrangian Relaxation
by: Dilson Lucas Pereira, et al.
Published: (2025)

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
by: Basu, Sabyasachi, et al.
Published: (2024)

Energy Conserved Failure Detection for NS-IoT Systems
by: Liu, Guojin, et al.
Published: (2024)

A Fully-dynamic Approximation Algorithm for Maximum Weight b-Matchings in Graphs
by: Brandt-Tumescheit, Fabian, et al.
Published: (2024)

FRANCIS: Fast Reaction Algorithms for Network Coordination In Switches
by: Han, Wenchen, et al.
Published: (2022)

Joint Semantic Coding and Routing for Multi-Hop Semantic Transmission in LEO Satellite Networks
by: Zeng, Hong, et al.
Published: (2026)