Sampling Sub-Problems of Heterogeneous Max-Cut Problems and Approximation Algorithms

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-31856-9_5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Random Sampling and Approximation of MAX-CSP Problems

2002English

An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems With Applications to Approximation Algorithms

1989English

Fast Approximation Algorithms for Multicommodity Flow Problems

1991English

Approximation Algorithms for Partial Covering Problems*1

Journal of Algorithms
2004English

Improving the Smoothed Complexity of FLIP for Max Cut Problems

2019English

Approximation Algorithms for Multi-Dimensional Vector Assignment Problems

SSRN Electronic Journal
2013English

Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems

English

Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems

2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy