scientific article; zbMATH DE number 1445322
From MaRDI portal
Publication:4952637
zbMath0952.90026MaRDI QIDQ4952637
Srinivas R. Doddi, Goran Konjevod, Madhav V. Marathe, Robert D. Carr
Publication date: 10 May 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (38)
Comparison of metaheuristics for the k‐labeled spanning forest problem ⋮ Labeled cuts in graphs ⋮ Sequence Hypergraphs ⋮ Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover} ⋮ Secluded connectivity problems ⋮ On the approximability of the minimum rainbow subgraph problem and other related problems ⋮ An improved algorithm for the red-blue hitting set problem with the consecutive ones property ⋮ On the hardness of labeled correlation clustering problem: a parameterized complexity view ⋮ Exact algorithms and hardness results for geometric red-blue hitting set problem ⋮ Approximation algorithms and hardness results for labeled connectivity problems ⋮ Sequence Hypergraphs: Paths, Flows, and Cuts ⋮ Approximation and hardness results for label cut and related problems ⋮ Logical correctors in the problem of classification by precedents ⋮ The parameterized complexity of some minimum label problems ⋮ Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems ⋮ The Computational Complexity of and Approximation Algorithms for Variants of the Component Selection Problem ⋮ On the geometric red-blue set cover problem ⋮ How to Navigate Through Obstacles ⋮ Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs ⋮ On the complexity of rainbow spanning forest problem ⋮ A hybrid metaheuristic for the minimum labeling spanning tree problem ⋮ Algorithms and complexity results for labeled correlation clustering problem ⋮ On the positive-negative partial set cover problem ⋮ Unnamed Item ⋮ Algorithms and complexity for a class of combinatorial optimization problems with labelling ⋮ The labeled maximum matching problem ⋮ The rainbow spanning forest problem ⋮ Frugal Routing on Wireless Ad-Hoc Networks ⋮ A constant-factor approximation algorithm for red-blue set cover with unit disks ⋮ Maximum cuts in edge-colored graphs ⋮ Multi-path algorithms for minimum-colour path problems with applications to approximating barrier resilience ⋮ A constant-factor approximation algorithm for red-blue set cover with unit disks ⋮ Approximating Component Selection with General Costs ⋮ Red-blue covering problems and the consecutive ones property ⋮ The labeled perfect matching in bipartite graphs ⋮ Geometric red-blue set cover for unit squares and related problems ⋮ Finding disjoint paths in networks with star shared risk link groups ⋮ Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem
This page was built for publication:
