feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    b3kat_BV047690316
    Format: 1 Online-Ressource (XIII, 714 p. 138 illus., 50 illus. in color)
    Edition: 1st ed. 2021
    ISBN: 9783030926816
    Series Statement: Theoretical Computer Science and General Issues 13135
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-030-92680-9
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-030-92682-3
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Kombinatorische Optimierung ; Konferenzschrift
    URL: Volltext  (URL des Erstveröffentlichers)
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    b3kat_BV048637678
    Format: 1 Online-Ressource (xiii, 416 Seiten) , 50 Illustrationen, 25 in Farbe
    ISBN: 9783031203503
    Series Statement: Lecture notes in computer science 13571
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-20349-7
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-20351-0
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Algorithmus ; Diskrete Mathematik ; Datenstruktur ; Konferenzschrift
    URL: Volltext  (URL des Erstveröffentlichers)
    Author information: Du, Dingzhu 1948-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    b3kat_BV048803710
    Format: xiii, 416 Seiten , Illustrationen, Diagramme
    ISBN: 9783031203497
    Series Statement: Lecture notes in computer science 13571
    Additional Edition: Erscheint auch als Online-Ausgabe ISBN 978-3-031-20350-3
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Algorithmus ; Diskrete Mathematik ; Datenstruktur ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    gbv_1657322580
    Format: Online-Ressource (XVI, 785 p. 109 illus, online resource)
    ISBN: 9783319213989
    Series Statement: Lecture Notes in Computer Science 9198
    Content: Algorithms and data structures -- Algorithmic game theory; approximation algorithms and online algorithms -- Automata, languages, logic and computability -- Complexity theory -- Computational learning theory -- Cryptography, reliability and security -- Database theory, computational biology and bioinformatics -- Computational algebra, geometry, number theory, graph drawing and information visualization -- Graph theory, communication networks, optimization and parallel and distributed computing.
    Content: This book constitutes the refereed proceedings of the 21st International Conference on Computing and Combinatorics, COCOON 2015, held in Beijing, China, in August 2015. The 49 revised full papers and 11 shorter papers presented were carefully reviewed and selected from various submissions. The papers cover various topics including algorithms and data structures; algorithmic game theory; approximation algorithms and online algorithms; automata, languages, logic and computability; complexity theory; computational learning theory; cryptography, reliability and security; database theory, computational biology and bioinformatics; computational algebra, geometry, number theory, graph drawing and information visualization; graph theory, communication networks, optimization and parallel and distributed computing.
    Note: Literaturangaben , Algorithms and data structuresAlgorithmic game theory; approximation algorithms and online algorithms -- Automata, languages, logic and computability -- Complexity theory -- Computational learning theory -- Cryptography, reliability and security -- Database theory, computational biology and bioinformatics -- Computational algebra, geometry, number theory, graph drawing and information visualization -- Graph theory, communication networks, optimization and parallel and distributed computing.
    Additional Edition: ISBN 9783319213972
    Additional Edition: Druckausg. Computing and combinatorics Cham [u.a.] : Springer, 2015 ISBN 9783319213972
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Theoretische Informatik ; Kombinatorik ; Berechenbarkeit ; Graph ; Algorithmus ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    UID:
    gbv_1830235508
    Format: 1 Online-Ressource(XIII, 416 p. 50 illus., 25 illus. in color.)
    Edition: 1st ed. 2022.
    ISBN: 9783031203503
    Series Statement: Lecture Notes in Computer Science 13571
    Content: Maximization of $k$-Submodular Function with a Matroid Constraint -- Maximizing Approximately Non-$k$-Submodular Monotone Set Function with Matroid Constraint -- Time-of-Use Scheduling Problem With Equal-Length Jobs -- Online Non-Submodular and Non-Convex Optimization with Stochastic Long-Term Constraints -- Physical ZKP for Makaro Using a Standard Deck of Cards -- Characterization of the Imbalance Problem on Complete Bipartite Graphs -- New Algorithms for a Simple Measure of Network Partitioning -- On Two Types of Concept Lattices in the Theory of Numberings -- Computing Connected-$k$-Subgraph Cover with Connectivity Requirement -- Analyzing the $3$-Path Vertex Cover Problem in Planar Bipartite Graphs -- Competition-Based Generalized Self-profit Maximization in Dual-Attribute Networks -- Largest Convex Hull for Constant Size, Convex-Hull Disjoint Clusters -- Two-Stage Submodular Maximization Under Knapsack Problem -- (Z, succ, U), (Z, E, U), and their CSP's -- Circle Graph Isomorphism in Almost Linear Time -- The Exact Subset MultiCover Problem -- Hide a Liar: Card-Based ZKP Protocol for Usowan -- Complexity Analysis of a Stochastic Variant of Generalized Alternating Direction Method of Multipliers -- A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem -- Exact and Parameterized Algorithms for Restricted Subset Feedback Vertex Set in Chordal Graphs -- An Approximation Algorithm for the B-prize-collecting Multicut Problem in Trees -- Two-Stage Non-Submodular Maximization -- Fault-Tolerant Total Domination via Submodular Function Approximation -- On the Parallel Complexity of Constrained Read-Once Refutations in UTVPI Constraint Systems -- Extracting Densest Sub-Hypergraph with Convex Edge-Weight Functions -- Exact and Approximation Algorithms for PMMS Under Identical Constraints -- Finite-State Relative Dimension, Dimensions of AP Subsequences and a Finite-State van Lambalgen's Theorem -- Distributed Connected Dominating Sets in Unit Square and Disk Graphs -- An Inventory System Optimization for Solving Joint Pricing and Ordering Problem with Trapezoidal Demand and Partial Backlogged Shortages in a Limited Sales Period -- A Set-Theoretic Representation of Algebraic L-Domains -- Normality, Randomness and Kolmogorov Complexity of Continued Fractions -- Weakly $k$-Submodular Maximization Under Matroid Constraint -- Approximation Algorithms for Diversity-Bounded Center Problems. .
    Content: This book constitutes the refereed proceedings of the 17th Annual Conference on Theory and Applications of Models of Computation, TAMC 2022, held as a virtual event, in September 2022. The 33 full papers were carefully reviewed and selected from 75 submissions. The main themes of the selected papers are computability, complexity, algorithms, information theory and their extensions to machine learning theory, and foundations of artificial intelligence.
    Additional Edition: ISBN 9783031203497
    Additional Edition: ISBN 9783031203510
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783031203497
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783031203510
    Additional Edition: Erscheint auch als Druck-Ausgabe TAMC (17. : 2022 : Tientsin) Theory and applications of models of computation Cham : Springer, 2022 ISBN 9783031203497
    Language: English
    Keywords: Algorithmus ; Datenstruktur ; Numerische Mathematik ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages