68Q25 Analysis of algorithms and problem complexity [See also 68W40]
Refine
Year of publication
Document Type
- ZIB-Report (16)
- Habilitation (1)
- Master's Thesis (1)
Has Fulltext
- yes (18)
Is part of the Bibliography
- no (18)
Keywords
- computational complexity (3)
- NP-completeness (2)
- approximation (2)
- approximation algorithm (2)
- contraction degeneracy (2)
- online algorithms (2)
- polynomial-time approximation algorithms (2)
- stacker-crane problem (2)
- treewidth lower bounds (2)
- Approximation (1)
- Approximation Algorithms (1)
- Call Admission (1)
- Colorability (1)
- Competitive Analysis (1)
- Computational Complexity (1)
- Dial-a-Ride problem (1)
- Dial-a-Ride problem on trees (1)
- Dimensionierung (1)
- Eulerian Cycle (1)
- IGNORE strategy (1)
- Inverse Shortest Paths (1)
- Komplexität (1)
- Komplexitätstheorie (1)
- Mehrfachausfälle (1)
- NP-hardness (1)
- Network (1)
- Netzplanung (1)
- Optical Networks (1)
- P=NP (1)
- Ramachandramurthi parameter (1)
- Routing and Wavelength Allocation (1)
- Shortest Path Routing (1)
- Shortest path routing (1)
- Spaltengenerierung (1)
- budgeted maximum coverage (1)
- column generation (1)
- competitive analysis (1)
- completeness (1)
- complexity (1)
- disjoint paths (1)
- dynamic programming (1)
- elevator system (1)
- genus of a graph (1)
- graph algorithms (1)
- length bounded paths (1)
- lower bounds (1)
- maximum cardinality search (1)
- online algorithm (1)
- online optimization (1)
- planar graphs (1)
- pricing (1)
- probabilistic analysis (1)
- probabilistic competitive analysis (1)
- reducibility (1)
- routing (1)
- shortest path routing (1)
- survivable network design (1)
- treewidth (1)
- unsplittable flow (1)
- vehicle (1)
- vehicle routing (1)
Institute
- ZIB Allgemein (15)
- Mathematical Optimization (4)
An instance of the \emph{maximum coverage} problem is given by a set of weighted ground elements and a cost weighted family of subsets of the ground element set. The goal is to select a subfamily of total cost of at most that of a given budget maximizing the weight of the covered elements. We formulate the problem on graphs: In this situation the set of ground elements is specified by the nodes of a graph, while the family of covering sets is restricted to connected subgraphs. We show that on general graphs the problem is polynomial time solvable if restricted to sets of size at most~$2$, but becomes NP-hard if sets of size~$3$ are permitted. On trees, we prove polynomial time solvability if each node appears in a fixed number of sets. In contrast, if vertices are allowed to appear an unbounded number of times, the problem is NP-hard even on stars. We finally give polynomial time algorithms for special cases where the subgraphs form paths and the host graph is a line, a cycle or a star.