rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Combinatorial Optimization and Graph Algorithms
    sub title: Communications of NII Shonan Meetings
  name:
    name part: Fukunaga, Takuro.
    role:
      role term: editor.
  name:
    name part: Kawarabayashi, Ken-ichi.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: si
    date issued: 2017
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: IX, 120 p. 11 illus., 2 illus. in color. online resource.
  abstract: Covering network designs, discrete convex analysis, facility location and clustering problems, matching games, and parameterized complexity, this book discusses theoretical aspects of combinatorial optimization and graph algorithms. Contributions are by renowned researchers who attended NII Shonan meetings on this essential topic. The collection contained here provides readers with the outcome of the authors’ research and productive meetings on this dynamic area, ranging from computer science and mathematics to operations research. Networks are ubiquitous in today's world: the Web, online social networks, and search-and-query click logs can lead to a graph that consists of vertices and edges. Such networks are growing so fast that it is essential to design algorithms to work for these large networks. Graph algorithms comprise an area in computer science that works to design efficient algorithms for networks. Here one can work on theoretical or practical problems where implementation of an algorithm for large networks is needed. In two of the chapters, recent results in graph matching games and fixed parameter tractability are surveyed. Combinatorial optimization is an intersection of operations research and mathematics, especially discrete mathematics, which deals with new questions and new problems, attempting to find an optimum object from a finite set of objects. Most problems in combinatorial optimization are not tractable (i.e., NP-hard). Therefore it is necessary to design an approximation algorithm for them. To tackle these problems requires the development and combination of ideas and techniques from diverse mathematical areas including complexity theory, algorithm theory, and matroids as well as graph theory, combinatorics, convex and nonlinear optimization, and discrete and convex geometry. Overall, the book presents recent progress in facility location, network design, and discrete convex analysis. iv>.
  table of contents: Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems -- Graph Stabilization: A Survey -- Spider Covering Algorithms for Network Design problems -- Discrete Convex Functions on Graphs and Their Algorithmic Applications -- Parameterized Complexity of the Workflow Satisfiability Problem.
  note: edited by Takuro Fukunaga, Ken-ichi Kawarabayashi.
  subject:
    topic: Computer science
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Discrete mathematics
  subject:
    topic: Computer Science
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Discrete Mathematics
  subject:
    topic: Operations Research/Decision Theory
  classification: QA76.9.M35
  classification: 004.0151
  related item:
    title info:
      title: Springer eBooks
  identifier: 9789811061479
  identifier: http://dx.doi.org/10.1007/978-981-10-6147-9
  record info:
    record creation date: 171002
    record change date: 20171002210238.0
    record identifier: 978-981-10-6147-9