<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Algorithmic Aspects in Information and Management</title>
    <subTitle>18th International Conference, AAIM 2024, Virtual Event, September 21–23, 2024, Proceedings, Part II</subTitle>
  </titleInfo>
  <name type="personal">
    <namePart>Ghosh, Smita.</namePart>
    <role>
      <roleTerm type="text">editor.</roleTerm>
    </role>
    <role>
      <roleTerm authority="marcrelator" type="code">edt</roleTerm>
    </role>
    <role>
      <roleTerm authority="marcrelator" type="code">http://id.loc.gov/vocabulary/relators/edt</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Zhang, Zhao.</namePart>
    <role>
      <roleTerm type="text">editor.</roleTerm>
    </role>
    <role>
      <roleTerm authority="marcrelator" type="code">edt</roleTerm>
    </role>
    <role>
      <roleTerm authority="marcrelator" type="code">http://id.loc.gov/vocabulary/relators/edt</roleTerm>
    </role>
  </name>
  <name type="corporate">
    <namePart>SpringerLink (Online service)</namePart>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">si</placeTerm>
    </place>
    <dateIssued encoding="marc">2024</dateIssued>
    <edition>1st ed. 2024.</edition>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">electronic</form>
    <form authority="gmd">electronic resource</form>
    <reformattingQuality>access</reformattingQuality>
    <extent>XV, 268 p. 63 illus., 37 illus. in color. online resource.</extent>
  </physicalDescription>
  <abstract>This two-volume set LNCS 15179-15180 constitutes the refereed proceedings of the 18th International Conference on Algorithmic Aspects in Information and Management, AAIM 2024, which took place virtually during September 21-23, 2024. The 45 full papers presented in these two volumes were carefully reviewed and selected from 76 submissions. The papers are organized in the following topical sections: Part I: Optimization and applications; submodularity, management and others, Part II: Graphs and networks; quantum and others.</abstract>
  <tableOfContents> -- Graphs and Networks.  -- Detection and Analysis of Cryptocurrency Scams on Twitter.  -- Representation of Dominating Set Variants using Dataless Neural Networks.  -- Algorithms for the Constrained Assignment Problems with Bounds and Maximum Penalty.  -- Enabling Proactive Microservice Placement in Collaborative Edge Computing Network.  -- Speeding Up Constrained $k$-Means Through 2-Means.  -- Stable Matching with Approval Preferences under Partial Information.  -- A polynomial time algorithm to find star chromatic index on bounded treewidth graphs with given maximum degree.  -- On the Kalai-Smorodinsky solutions for Bi-objective Spanning Tree Problem.  -- Improved approximation algorithms for Patrol-Scheduling with Min-Max Latency using Multiclass Minimum Spanning Forests.  -- Time-Sensitive Target Coverage Under Visibility Constraints with UAVs.  -- Online bottleneck matching on a star.  -- Quantum Annealing and GNN for Solving TSP with QUBO.  -- Task Planning for The Multi-center Heterogeneous Vehicle Pickup and Delivery Problem.  -- Plane Segmentation for Proportional Division of Resources.  -- Fair Division with Weighted and Prioritized Agents.  -- The Characterizations and Complexity of Roman {2}-Domination and 2- Domination in Graphs.  -- Quantum and Others.  -- Quantum Lung Segmentation: QCU-Net Applied to Chest X-ray Images.  -- On the Existence of Parameterized Algorithms for the Shortest Common Supersequence and Related Problems.  -- Algorithmic Construction of Tessellation Cover to QUBO Formulations.  -- Finding Fair and Efficient Allocations of Indivisible Chores.  -- An Algebraic Perspective on Tree Imbalance Metrics.  -- Towards understanding news plagiarism: theoretical and experimental analysis.</tableOfContents>
  <note type="statement of responsibility">edited by Smita Ghosh, Zhao Zhang.</note>
  <subject authority="lcsh">
    <topic>Computer science</topic>
    <topic>Mathematics</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Discrete mathematics</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Data structures (Computer science)</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Information theory</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Artificial intelligence</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Computer science</topic>
  </subject>
  <subject>
    <topic>Discrete Mathematics in Computer Science</topic>
  </subject>
  <subject>
    <topic>Data Structures and Information Theory</topic>
  </subject>
  <subject>
    <topic>Artificial Intelligence</topic>
  </subject>
  <subject>
    <topic>Theory of Computation</topic>
  </subject>
  <classification authority="lcc">QA76.9.M35</classification>
  <classification authority="lcc">QA297.4</classification>
  <relatedItem type="host">
    <titleInfo>
      <title>Springer Nature eBook</title>
    </titleInfo>
  </relatedItem>
  <relatedItem type="otherFormat" displayLabel="Printed edition:"/>
  <relatedItem type="otherFormat" displayLabel="Printed edition:"/>
  <relatedItem type="series">
    <titleInfo>
      <title>Lecture Notes in Computer Science, 15180</title>
    </titleInfo>
  </relatedItem>
  <identifier type="isbn">9789819778010</identifier>
  <identifier type="uri">https://doi.org/10.1007/978-981-97-7801-0</identifier>
  <location>
    <url>https://doi.org/10.1007/978-981-97-7801-0</url>
  </location>
  <recordInfo>
    <recordCreationDate encoding="marc">240918</recordCreationDate>
    <recordChangeDate encoding="iso8601">20251030113053.0</recordChangeDate>
    <recordIdentifier source="DE-He213">978-981-97-7801-0</recordIdentifier>
  </recordInfo>
</mods>
