Coverart for item
The Resource Combinatorial optimization and graph algorithms : communications of NII Shonan Meetings, Takuro Fukunaga, Ken-ichi Kawarabayashi, editors, (electronic book)

Combinatorial optimization and graph algorithms : communications of NII Shonan Meetings, Takuro Fukunaga, Ken-ichi Kawarabayashi, editors, (electronic book)

Label
Combinatorial optimization and graph algorithms : communications of NII Shonan Meetings
Title
Combinatorial optimization and graph algorithms
Title remainder
communications of NII Shonan Meetings
Statement of responsibility
Takuro Fukunaga, Ken-ichi Kawarabayashi, editors
Contributor
Editor
Subject
Language
eng
Member of
Cataloging source
N$T
Dewey number
511.6
Illustrations
illustrations
Index
no index present
LC call number
QA164
Literary form
non fiction
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
  • Fukunaga, Takuro
  • Kawarabayashi, Ken-ichi
http://library.link/vocab/subjectName
  • Combinatorial optimization
  • Graph algorithms
  • Graph theory
  • Computer algorithms
Label
Combinatorial optimization and graph algorithms : communications of NII Shonan Meetings, Takuro Fukunaga, Ken-ichi Kawarabayashi, editors, (electronic book)
Instantiates
Publication
Antecedent source
unknown
Bibliography note
Includes bibliographical references
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
  • ""Preface""; ""Contents""; ""Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems""; ""1 Introduction""; ""2 Local Search Algorithms""; ""2.1 Uncapacitated Facility Location""; ""2.2 Capacitated Facility Location""; ""2.3 k-median and k-means""; ""3 LP-Based Algorithms""; ""3.1 LP-Rounding for Facility Location""; ""3.2 Primal-Dual Algorithms for Facility Location""; ""3.3 k-median and Its Relaxations""; ""3.4 Capacitated Problems""; ""4 Future Directions""; ""References""; ""Graph Stabilization: A Survey""; ""1 Introduction""; ""1.1 Definitions""
  • ""2 Characterizing Stable Graphs""""3 Edge Modifications""; ""3.1 Edge Deletion""; ""3.2 Edge Addition""; ""4 Vertex Modifications""; ""4.1 Vertex Deletion""; ""4.2 Min Cost Vertex Deletion""; ""4.3 Vertex Addition""; ""5 Edge Weight Addition""; ""6 Further Open Problems""; ""References""; ""Spider Covering Algorithms for Network Design Problems""; ""1 Introduction""; ""1.1 Organization""; ""2 Preliminaries""; ""3 Spider Covering Algorithm for the Node-Weighted Steiner Tree""; ""4 LP-Based Analysis of the Spider Covering Algorithm""; ""5 Node-Weighted Edge-Connectivity Network Design""
  • ""6 Node-Connectivity Network Activation Problem""""7 Other Applications""; ""7.1 Prize-Collecting Network Design Problems""; ""7.2 Buy-at-bulk Network Design Problems""; ""7.3 Directed Steiner Tree and Forest Problems""; ""7.4 Online Network Design Problems""; ""8 Conclusion""; ""References""; ""Discrete Convex Functions on Graphs and Their Algorithmic Applications""; ""1 Introduction""; ""2 L-Convex Function on Grid-Like Structure""; ""2.1 L-Convex Function on Tree-Grid""; ""2.2 L-Convex Function on Twisted Tree-Grid""; ""2.3 Steepest Descent Algorithm""
  • ""2.4 L-Convex Function on Euclidean Building""""3 Application""; ""3.1 Minimum-Cost Multiflow and Terminal Backup""; ""3.2 Node-Capacitated Multiflow and Node-Multiway Cut""; ""4 L-Convex Function on Oriented Modular Graph""; ""4.1 Motivation: Minimum 0-Extension Problem""; ""4.2 Submodular Function on Modular Semilattice""; ""4.3 L-Convex Function on Oriented Modular Graph""; ""References""; ""Parameterized Complexity of the Workflow Satisfiability Problem""; ""1 Introduction""; ""1.1 The Workflow and Constraint Satisfiability Problems""; ""1.2 Parameterized Complexity Approach to WSP""
  • ""2 Background""""2.1 Constraints and Authorization Lists""; ""2.2 Complexity of WSP""; ""2.3 Fixed-Parameter Tractability and WSP""; ""3 Fixed-Parameter Tractability Results""; ""3.1 Regular Constraints""; ""3.2 User-Independent Constraints""; ""3.3 Class-Independent Constraints""; ""4 Characterizing the FPT Languages""; ""4.1 Equivalent Partial Solutions and a Diversity Measure""; ""5 Classical Tractable Conservative Constraint Languages""; ""6 Concluding Remarks""
Dimensions
unknown
Extent
1 online resource
File format
unknown
Form of item
online
Isbn
9789811061479
Isbn Type
(ebk)
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other physical details
illustrations.
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
  • (OCoLC)1005354031
  • on1005354031
Label
Combinatorial optimization and graph algorithms : communications of NII Shonan Meetings, Takuro Fukunaga, Ken-ichi Kawarabayashi, editors, (electronic book)
Publication
Antecedent source
unknown
Bibliography note
Includes bibliographical references
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
  • ""Preface""; ""Contents""; ""Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems""; ""1 Introduction""; ""2 Local Search Algorithms""; ""2.1 Uncapacitated Facility Location""; ""2.2 Capacitated Facility Location""; ""2.3 k-median and k-means""; ""3 LP-Based Algorithms""; ""3.1 LP-Rounding for Facility Location""; ""3.2 Primal-Dual Algorithms for Facility Location""; ""3.3 k-median and Its Relaxations""; ""3.4 Capacitated Problems""; ""4 Future Directions""; ""References""; ""Graph Stabilization: A Survey""; ""1 Introduction""; ""1.1 Definitions""
  • ""2 Characterizing Stable Graphs""""3 Edge Modifications""; ""3.1 Edge Deletion""; ""3.2 Edge Addition""; ""4 Vertex Modifications""; ""4.1 Vertex Deletion""; ""4.2 Min Cost Vertex Deletion""; ""4.3 Vertex Addition""; ""5 Edge Weight Addition""; ""6 Further Open Problems""; ""References""; ""Spider Covering Algorithms for Network Design Problems""; ""1 Introduction""; ""1.1 Organization""; ""2 Preliminaries""; ""3 Spider Covering Algorithm for the Node-Weighted Steiner Tree""; ""4 LP-Based Analysis of the Spider Covering Algorithm""; ""5 Node-Weighted Edge-Connectivity Network Design""
  • ""6 Node-Connectivity Network Activation Problem""""7 Other Applications""; ""7.1 Prize-Collecting Network Design Problems""; ""7.2 Buy-at-bulk Network Design Problems""; ""7.3 Directed Steiner Tree and Forest Problems""; ""7.4 Online Network Design Problems""; ""8 Conclusion""; ""References""; ""Discrete Convex Functions on Graphs and Their Algorithmic Applications""; ""1 Introduction""; ""2 L-Convex Function on Grid-Like Structure""; ""2.1 L-Convex Function on Tree-Grid""; ""2.2 L-Convex Function on Twisted Tree-Grid""; ""2.3 Steepest Descent Algorithm""
  • ""2.4 L-Convex Function on Euclidean Building""""3 Application""; ""3.1 Minimum-Cost Multiflow and Terminal Backup""; ""3.2 Node-Capacitated Multiflow and Node-Multiway Cut""; ""4 L-Convex Function on Oriented Modular Graph""; ""4.1 Motivation: Minimum 0-Extension Problem""; ""4.2 Submodular Function on Modular Semilattice""; ""4.3 L-Convex Function on Oriented Modular Graph""; ""References""; ""Parameterized Complexity of the Workflow Satisfiability Problem""; ""1 Introduction""; ""1.1 The Workflow and Constraint Satisfiability Problems""; ""1.2 Parameterized Complexity Approach to WSP""
  • ""2 Background""""2.1 Constraints and Authorization Lists""; ""2.2 Complexity of WSP""; ""2.3 Fixed-Parameter Tractability and WSP""; ""3 Fixed-Parameter Tractability Results""; ""3.1 Regular Constraints""; ""3.2 User-Independent Constraints""; ""3.3 Class-Independent Constraints""; ""4 Characterizing the FPT Languages""; ""4.1 Equivalent Partial Solutions and a Diversity Measure""; ""5 Classical Tractable Conservative Constraint Languages""; ""6 Concluding Remarks""
Dimensions
unknown
Extent
1 online resource
File format
unknown
Form of item
online
Isbn
9789811061479
Isbn Type
(ebk)
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other physical details
illustrations.
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
  • (OCoLC)1005354031
  • on1005354031

Library Locations

Processing Feedback ...