Pages that link to "Item:Q5096796"

The following pages link to On the approximability of the maximum common subgraph problem (Q5096796):

Displaying 20 items.

• Capacity inverse minimum cost flow problems under the weighted Hamming distance (Q315493) (← links)
• The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
• Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
• Approximate solution of NP optimization problems (Q672315) (← links)
• Exact localisations of feedback sets (Q722200) (← links)
• Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees (Q834895) (← links)
• On parameterized complexity of the multi-MCS problem (Q1019178) (← links)
• On the complexity of compressing two dimensional routing tables with order (Q1702127) (← links)
• Beyond rankings: comparing directed acyclic graphs (Q1715891) (← links)
• A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree (Q1736548) (← links)
• A fast discovery algorithm for large common connected induced subgraphs (Q2274094) (← links)
• Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
• The approximation of maximum subgraph problems (Q4630247) (← links)
• Polynomially bounded minimization problems which are hard to approximate (Q4630248) (← links)
• Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover (Q4630249) (← links)
• (Q5090449) (← links)
• Aligning and Labeling Genomes under the Duplication-Loss Model (Q5326363) (← links)
• Structure in approximation classes (Q6085751) (← links)
• Reachability in choice networks (Q6108917) (← links)
• Geometric dominating-set and set-cover via local-search (Q6114477) (← links)