Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme

doi 10.1145/3313276.3316394
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2002English

An Algorithm for the Quadratic Approximation

Journal of Computational and Applied Mathematics
Computational MathematicsApplied Mathematics
1984English

Network Design for Vertex Connectivity

2008English

An Information-Based Approximation Scheme for Stochastic Optimization Problems in Continuous Time

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2009English

Approximation and Kernelization for Chordal Vertex Deletion

2017English

An Approximation Method for Solving Nonconvex Quadratic Programming Problems

Journal of Applied Sciences
2011English

A Fully Polynomial Time Approximation Scheme for Packing While Traveling

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

A Convergence Result for an Outer Approximation Scheme

Computational & Applied Mathematics
2003English

Adapted Quadratic Approximation for Singular Integrals

Journal of Mathematical Inequalities
Analysis
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy