Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems

doi 10.1007/978-3-540-76796-1_9
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

Degree-Constrained Subgraph Problems: Hardness and Approximation Results

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

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

2009English

Linear Time Algorithms for Clustering Problems in Any Dimensions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Cutting Plane Algorithms and State Space Constrained Linear Optimal Control Problems

1969English

A General Approximation Technique for Constrained Forest Problems

SIAM Journal on Computing
MathematicsComputer Science
1995English

Approximation Algorithms for Partial Covering Problems*1

Journal of Algorithms
2004English

Fast Approximation Algorithms for Multicommodity Flow Problems

1991English

Partial Sample Average Approximation Method for Chance Constrained Problems

Optimization Letters
ControlOptimization
2018English

Approximation Algorithms for Multi-Dimensional Vector Assignment Problems

SSRN Electronic Journal
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy