A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals

doi 10.1137/1.9781611975031.95
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus

SIAM Journal on Discrete Mathematics
Mathematics
1996English

POISSON APPROXIMATION FOR THE NUMBER OF OPIES OF a FIXED GRAPH IN a RANDOM D-Regular GRAPH

International Journal of Pure and Applied Mathematics
MathematicsApplied Mathematics
2014English

Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

A Subquadratic Approximation Scheme for Partition

2019English

Linear (T,n) Secret Sharing Scheme With Reduced Number of Polynomials

Security and Communication Networks
Computer NetworksInformation SystemsCommunications
2019English

A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2017English

An Algorithm for Solving an Integer Linear Programming Problem With a Fixed Number of Variables in Polynominal Time.

English

On THE NUMBER OF INVERSION\newline OUTCOMES OF THE PERMUTATION SCHEME AND ITS ANALYSIS WITH FIXED NUMBER OF INVERSIONS

Proceedings of the Karelian Research Centre of the Russian Academy of Sciences
2015English

Tiling the Plane With a Fixed Number of Polyominoes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy