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:
    gbv_1728471826
    Format: 1 Online-Ressource(XI, 640 p. 151 illus., 61 illus. in color.)
    Edition: 1st ed. 2020.
    ISBN: 9783030576028
    Series Statement: Theoretical Computer Science and General Issues 12290
    Content: Polynomial-time algorithms for the touring rays and related problems -- Polyhedral Circuits and Their Applications -- Online Bicriteria Algorithms to Balance Coverage and Cost in Team Formation -- Approximation Algorithm for Stochastic Set Cover Problem -- On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane -- Minimum Diameter Vertex-Weighted Steiner Tree -- Community-based Rumor Blocking Maximization in Social Networks -- Improved hardness and approximation results for single allocationhub location -- Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs -- 2-Level Station Location for Bike Sharing -- Approximation Algorithms for the Lower-Bounded Knapsack Median Problem -- The spherical k-means++ algorithm via local search -- Local search algorithm for the spherical k-means problem with outliers -- A Bi-Criteria Analysis for Fuzzy C-means Problem -- Approximating Max k-Uncut via LP-rounding plus Greed, with Applications to Densest k-Subgraph -- Online BP functions maximization -- Adaptive Robust Submodular Optimization and Beyond -- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint -- Fast Algorithms for Maximizing Monotone Nonsubmodular Functions -- Non-Submodular Streaming Maximization with Minimum Memory and Low Adaptive Complexity -- On Fixed-order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering -- Selfish Bin Packing with Parameterized Punishment -- Multiple Facility Location Games with Envy Ratio -- Strategyproof Mechanisms for 2-facility Location Games with Minimax Envy -- Robustness and Approximation for the Linear Contract Design -- Scheduling many types of calibrations -- Efficient mobile charger scheduling in large-scale sensor networks -- Revisit of the Scheduling Problems with Integrated Production and Delivery on Parallel Batching Machines -- Range Partitioning within Sublinear Time in the External Memory Model -- New Results on the Complexity of Deletion Propagation -- Search Complexity: A Way for The Quantitative Analysis of The Search Space -- Multi-AGVs Pathfinding based on Improved Jump Point Search in Logistic Center -- Distance-based Adaptive Large Neighborhood Search Algorithm for Green-PDPTW -- The theories of a novel filled function method for non-smooth global optimization -- Complexity of tree-coloring interval graphs equitably -- Approximation algorithms for balancing signed graphs -- Computing the One-Visibility Copnumber of Trees -- Maximum subgraphs in Ramsey graphs -- Independent perfect domination sets in Semi-Cayley graphs -- A Parallel Algorithm for Constructing Two Edge-disjoint Hamiltonian Cycles in Crossed Cubes -- Antipodal radio labelling of full binary trees -- Total coloring of outer-1-planar graphs: the cold case -- Edge-face list coloring of Halin graphs -- Injective Coloring of Halin Graphs -- The list L(2, 1)-labeling of planar graphs with large girth -- The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem -- Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery -- A Batch Scheduling Problem of Automatic Drug Dispensing System in Outpatient Pharmacy -- A two-stage medical expenses estimation model for inpatients during diagnosis process under artificial intelligence environment -- The Early-Warning Model of Evaluation and Prevention for Venous Thromboembolism in Gynecological Tumor Surgical Patients based on WSOM -- The coordinated decisions of service supply chain between tumor healthcare alliance and patients under government intervention -- Medical data compression and sharing technology based on blockchain -- Model Establishment and Algorithm Research of Tumor Marker Combination Prediction for Colorectal Cancer -- Safety Evaluation and Lean Disposal of Clinical Waste in Outpatient and Emergency Department of Large Hospitals -- Effects of Taiji on Participants' Knees: A Behavioral-Modeling Approach -- Mixed Distribution of Relief Materials with the Consideration of Demand Matching Degree.
    Content: This volume constitutes the proceedings of the 14th International Conference on Algorithmic Aspects in Information and Management, AAIM 2020, held in Jinhua, China in August 2020. The 39 full papers and 17 short papers presented were carefully reviewed and selected from 76 submissions. The papers deal with emerging important algorithmic problems with a focus on the fundamental background, theoretical technology development, and real-world applications associated with information and management analysis, modeling and data mining. Special considerations are given to algorithmic research that was motivated by real-world applications.
    Additional Edition: ISBN 9783030576011
    Additional Edition: ISBN 9783030576035
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783030576011
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783030576035
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    gbv_175001601X
    Format: 1 Online-Ressource(XV, 422 p. 149 illus., 108 illus. in color.)
    Edition: 1st ed. 2021.
    ISBN: 9783030688516
    Series Statement: Information Systems and Applications, incl. Internet/Web, and HCI 12382
    Content: This book constitutes the refereed proceedings of the 13th International Conference on Security, Privacy, and Anonymity in Computation, Communication, and Storage, SpaCCS 2020, held in Nanjing, China, in December 2020. The 30 full papers were carefully reviewed and selected from 88 submissions. The papers cover many dimensions including security algorithms and architectures, privacy-aware policies, regulations and techniques, anonymous computation and communication, encompassing fundamental theoretical approaches, practical experimental projects, and commercial application systems for computation, communication and storage. SpaCCS 2020 is held jointly with the 11th International Workshop on Trust, Security and Privacy for Big Data (TrustData 2020), the 10th International Symposium on Trust, Security and Privacy for Emerging Applications (TSP 2020), the 9th International Symposium on Security and Privacy on Internet of Things (SPIoT 2020), the 6th International Symposium on Sensor-Cloud Systems (SCS 2020), the 2nd International Workshop on Communication, Computing, Informatics and Security (CCIS 2020), the First International Workshop on Intelligence and Security in Next Generation Networks (ISNGN 2020), the First International Symposium on Emerging Information Security and Applications (EISA 2020).
    Additional Edition: ISBN 9783030688509
    Additional Edition: ISBN 9783030688523
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783030688509
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783030688523
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    gbv_1750016001
    Format: 1 Online-Ressource(XXI, 600 p. 66 illus., 1 illus. in color.)
    Edition: 1st ed. 2021.
    ISBN: 9783030688844
    Series Statement: Information Systems and Applications, incl. Internet/Web, and HCI 12383
    Content: This book constitutes seven refereed workshops and symposiums, SpaCCS Workshops 2020, which are held jointly with the 13th International Conference on Security, Privacy, and Anonymity in Computation, Communication, and Storage, SpaCCS 2020, in Nanjing, China, in December 2020. The 48 papers were carefully reviewed and selected from 131 submissions and cover a broad range of topics on security, privacy and anonymity in computation communication, and storage, including the 11th International Workshop on Trust, Security and Privacy for Big Data (TrustData 2020), the 10th International Symposium on Trust, Security and Privacy for Emerging Applications (TSP 2020), the 9th International Symposium on Security and Privacy on Internet of Things (SPIoT 2020), the 6th International Symposium on Sensor-Cloud Systems (SCS 2020), the Second International Workshop on Communication, Computing, Informatics and Security (CCIS 2020), the First International Workshop on Intelligence and Security in Next Generation Networks (ISNGN 2020), the First International Symposium on Emerging Information Security and Applications (EISA 2020).
    Additional Edition: ISBN 9783030688837
    Additional Edition: ISBN 9783030688851
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783030688837
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783030688851
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    gbv_1654646792
    Format: Online-Ressource (XIII, 810 p. 198 illus. in color, online resource)
    Edition: 1st ed. 2015
    ISBN: 9783319266268
    Series Statement: Lecture Notes in Computer Science 9486
    Content: This book constitutes the refereed proceedings of the 9th International Conference on Combinatorial Optimization and Applications, COCOA 2015, held in Houston, TX, USA, in December 2015. The 59 full papers included in the book were carefully reviewed and selected from 125 submissions. Topics covered include classic combinatorial optimization; geometric optimization; network optimization; applied optimization; complexity and game; and optimization in graphs.
    Note: Literaturangaben
    Additional Edition: ISBN 9783319266251
    Additional Edition: Druckausg. ISBN 978-3-319-26625-1
    Additional Edition: Erscheint auch als Druck-Ausgabe Combinatorial optimization and applications Cham [u.a.] : Springer, 2015 ISBN 9783319266251
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Kombinatorische Optimierung ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    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