Amanote Research

Amanote Research

    RegisterSign In

Combinatorial Algorithms

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-030-25005-8
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2019

Authors

Unknown

Publisher

Springer International Publishing


Related search

High-Performance Combinatorial Algorithms

2003English

A Theory and Algorithms for Combinatorial Reoptimization

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2017English

A Theory and Algorithms for Combinatorial Reoptimization

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Explicit Combinatorial Structures for Cooperative Distributed Algorithms

English

Bidding Algorithms for a Distributed Combinatorial Auction

2007English

Polynomial Local Improvement Algorithms in Combinatorial Optimization.

1981English

Fast Line Detection Algorithms Based on Combinatorial Optimization

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Approximation Algorithms for Combinatorial Auctions With Complement-Free Bidders

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2010English

Exact Combinatorial Algorithms and Experiments for Finding Maximum K-Plexes

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy