Coverart for item
The Resource Combinatorial optimization and applications : 6th International Conference, COCOA 2012, Banff, AB, Canada, August 5-9, 2012. Proceedings, Guohui Lin (ed.)

Combinatorial optimization and applications : 6th International Conference, COCOA 2012, Banff, AB, Canada, August 5-9, 2012. Proceedings, Guohui Lin (ed.)

Label
Combinatorial optimization and applications : 6th International Conference, COCOA 2012, Banff, AB, Canada, August 5-9, 2012. Proceedings
Title
Combinatorial optimization and applications
Title remainder
6th International Conference, COCOA 2012, Banff, AB, Canada, August 5-9, 2012. Proceedings
Statement of responsibility
Guohui Lin (ed.)
Title variation
COCOA 2012
Creator
Contributor
Subject
Genre
Language
eng
Summary
This book constitutes the refereed proceedings of the 6th International Conference, COCOA 2012, held in Banff, Alberta, Canada, in August 2012. The 33 revised papers including one invited talk and one keynote talk were carefully reviewed and selected from 57 submissions. The papers are focused to theoretical results and also on recent works on experimental and applied research of general algorithmic interest
Member of
Cataloging source
GW5XE
Dewey number
519.6/4
Illustrations
illustrations
Index
index present
LC call number
QA402.5
LC item number
.C63 2012
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2012
http://bibfra.me/vocab/lite/meetingName
COCOA (Conference)
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
Lin, Guohui
Series statement
  • Lecture notes in computer science,
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
7402
http://library.link/vocab/subjectName
  • Combinatorial optimization
  • Computer science
  • Informatique
  • Combinatorial optimization
  • Computer science
Label
Combinatorial optimization and applications : 6th International Conference, COCOA 2012, Banff, AB, Canada, August 5-9, 2012. Proceedings, Guohui Lin (ed.)
Instantiates
Publication
Antecedent source
unknown
Bibliography note
Includes bibliographical references and author index
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
  • The Edge-Centered Surface Area of the Arrangement Graph
  • Eddie Cheng, Ke Qiu and Zhizhang Shen
  • On Zero Forcing Number of Permutation Graphs
  • Eunjeong Yi
  • Complexity Results for the Empire Problem in Collection of Stars
  • Basile Couetoux, Jérome Monnot and Sonia Toubaline
  • Hamiltonian Paths and Cycles in Planar Graphs
  • Sudip Biswas, Stephane Durocher, Debajyoti Mondal and Rahnuma Islam Nishat
  • Feedback Vertex Sets on Tree Convex Bipartite Graphs
  • Chaoyi Wang, Tian Liu, Wei Jiang and Ke Xu
  • Load-Balanced Virtual Backbone Construction for Wireless Sensor Networks
  • Crossing Angles of Geometric Graphs
  • Karin Arikushi and Csaba D. Tóth
  • Multicut on Graphs of Bounded Clique-Width
  • Martin Lackner, Reinhard Pichler, Stefan Rümmele and Stefan Woltran
  • Radiation Hybrid Map Construction Problem Parameterized
  • Chihao Zhang, Haitao Jiang and Binhai Zhu
  • On the Central Path Problem
  • Yongding Zhu and Jinhui Xu
  • On the Generalized Multiway Cut in Trees Problem
  • Hong Liu and Peng Zhang
  • Jing (Selena) He, Shouling Ji, Yi Pan and Zhipeng Cai
  • Algorithms for Forest Local Similarity
  • Zhewei Liang and Kaizhong Zhang
  • Speedup of RNA Pseudoknotted Secondary Structure Recurrence Computation with the Four-Russians Method
  • Yelena Frid and Dan Gusfield
  • An Improved Approximation Algorithm for the Bandpass-2 Problem
  • Zhi-Zhong Chen and Lusheng Wang
  • Maximum Matching in Multi-Interface Networks
  • Adrian Kosowski, Alfredo Navarra, Dominik Pajak and Cristina M. Pinotti
  • Stretch Factor in Wireless Sensor Networks with Directional Antennae
  • Evangelos Kranakis, Fraser MacQuarrie and Oscar Morales-Ponce
  • On the Minimum Diameter Cost-Constrained Steiner Tree Problem
  • Wei Ding and Guoliang Xue
  • Domatic Partition on Several Classes of Graphs
  • Sheung-Hung Poon, William Chung-Kung Yen and Chin-Ting Ung
  • Online Bottleneck Matching
  • Barbara M. Anthony and Christine Chung
  • Streaming with Minimum Space: An Algorithm for Covering by Two Congruent Balls
  • Chung Keung Poon and Binhai Zhu
  • Online Joint Pricing and Booking Policies in Airline Revenue Management
  • Guanqun Ni and Yinfeng Xu
  • Minimizing Total Weighted Completion Time with Unexpected Machine Unavailability
  • Yumei Huo, Boris Reznichenko and Hairong Zhao
  • The b-Matching Problem in Hypergraphs: Hardness and Approximability
  • Characterizing Mechanisms in Obnoxious Facility Game
  • Ken Ibara and Hiroshi Nagamochi
  • Efficiency of Dual Equilibria in Selfish Task Allocation to Selfish Machines
  • Xujin Chen, Xiaodong Hu, Weidong Ma and Changjun Wang
  • Fast-Mixed Searching on Graphs
  • Boting Yang
  • Inapproximability after Uniqueness Phase Transition in Two-Spin Systems
  • Jin-Yi Cai, Xi Chen, Heng Guo and Pinyan Lu
  • Dynamic Programming for a Biobjective Search Problem in a Line
  • Luís Paquete, Mathias Jaschob, Kathrin Klamroth and Jochen Gorski
  • Mourad El Ouali and Gerold Jäger
  • Characterizing Graphs of Small Carving-Width
  • Rémy Belmonte, Pim van 't Hof, Marcin Kamiński, Daniël Paulusma and Dimitrios M. Thilikos
  • Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
  • Neng Fan and Jean-Paul Watson
  • Measuring Structural Similarities of Graphs in Linear Time
  • Zheng Fang, You Li and Jie Wang
  • Resource Scheduling with Supply Constraint and Linear Cost
  • Qiang Zhang, Weiwei Wu and Minming Li
  • On Certain Geometric Properties of the Yao-Yao Graphs
  • Iyad A. Kanj and Ge Xia
  • Distance-d Independent Set Problems for Bipartite and Chordal Graphs
  • Hiroshi Eto, Fengrui Guo and Eiji Miyano
Control code
804845691
Dimensions
unknown
Extent
1 online resource (xi, 398 pages)
File format
unknown
Form of item
online
Isbn
9783642317705
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)804845691
Label
Combinatorial optimization and applications : 6th International Conference, COCOA 2012, Banff, AB, Canada, August 5-9, 2012. Proceedings, Guohui Lin (ed.)
Publication
Antecedent source
unknown
Bibliography note
Includes bibliographical references and author index
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
  • The Edge-Centered Surface Area of the Arrangement Graph
  • Eddie Cheng, Ke Qiu and Zhizhang Shen
  • On Zero Forcing Number of Permutation Graphs
  • Eunjeong Yi
  • Complexity Results for the Empire Problem in Collection of Stars
  • Basile Couetoux, Jérome Monnot and Sonia Toubaline
  • Hamiltonian Paths and Cycles in Planar Graphs
  • Sudip Biswas, Stephane Durocher, Debajyoti Mondal and Rahnuma Islam Nishat
  • Feedback Vertex Sets on Tree Convex Bipartite Graphs
  • Chaoyi Wang, Tian Liu, Wei Jiang and Ke Xu
  • Load-Balanced Virtual Backbone Construction for Wireless Sensor Networks
  • Crossing Angles of Geometric Graphs
  • Karin Arikushi and Csaba D. Tóth
  • Multicut on Graphs of Bounded Clique-Width
  • Martin Lackner, Reinhard Pichler, Stefan Rümmele and Stefan Woltran
  • Radiation Hybrid Map Construction Problem Parameterized
  • Chihao Zhang, Haitao Jiang and Binhai Zhu
  • On the Central Path Problem
  • Yongding Zhu and Jinhui Xu
  • On the Generalized Multiway Cut in Trees Problem
  • Hong Liu and Peng Zhang
  • Jing (Selena) He, Shouling Ji, Yi Pan and Zhipeng Cai
  • Algorithms for Forest Local Similarity
  • Zhewei Liang and Kaizhong Zhang
  • Speedup of RNA Pseudoknotted Secondary Structure Recurrence Computation with the Four-Russians Method
  • Yelena Frid and Dan Gusfield
  • An Improved Approximation Algorithm for the Bandpass-2 Problem
  • Zhi-Zhong Chen and Lusheng Wang
  • Maximum Matching in Multi-Interface Networks
  • Adrian Kosowski, Alfredo Navarra, Dominik Pajak and Cristina M. Pinotti
  • Stretch Factor in Wireless Sensor Networks with Directional Antennae
  • Evangelos Kranakis, Fraser MacQuarrie and Oscar Morales-Ponce
  • On the Minimum Diameter Cost-Constrained Steiner Tree Problem
  • Wei Ding and Guoliang Xue
  • Domatic Partition on Several Classes of Graphs
  • Sheung-Hung Poon, William Chung-Kung Yen and Chin-Ting Ung
  • Online Bottleneck Matching
  • Barbara M. Anthony and Christine Chung
  • Streaming with Minimum Space: An Algorithm for Covering by Two Congruent Balls
  • Chung Keung Poon and Binhai Zhu
  • Online Joint Pricing and Booking Policies in Airline Revenue Management
  • Guanqun Ni and Yinfeng Xu
  • Minimizing Total Weighted Completion Time with Unexpected Machine Unavailability
  • Yumei Huo, Boris Reznichenko and Hairong Zhao
  • The b-Matching Problem in Hypergraphs: Hardness and Approximability
  • Characterizing Mechanisms in Obnoxious Facility Game
  • Ken Ibara and Hiroshi Nagamochi
  • Efficiency of Dual Equilibria in Selfish Task Allocation to Selfish Machines
  • Xujin Chen, Xiaodong Hu, Weidong Ma and Changjun Wang
  • Fast-Mixed Searching on Graphs
  • Boting Yang
  • Inapproximability after Uniqueness Phase Transition in Two-Spin Systems
  • Jin-Yi Cai, Xi Chen, Heng Guo and Pinyan Lu
  • Dynamic Programming for a Biobjective Search Problem in a Line
  • Luís Paquete, Mathias Jaschob, Kathrin Klamroth and Jochen Gorski
  • Mourad El Ouali and Gerold Jäger
  • Characterizing Graphs of Small Carving-Width
  • Rémy Belmonte, Pim van 't Hof, Marcin Kamiński, Daniël Paulusma and Dimitrios M. Thilikos
  • Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
  • Neng Fan and Jean-Paul Watson
  • Measuring Structural Similarities of Graphs in Linear Time
  • Zheng Fang, You Li and Jie Wang
  • Resource Scheduling with Supply Constraint and Linear Cost
  • Qiang Zhang, Weiwei Wu and Minming Li
  • On Certain Geometric Properties of the Yao-Yao Graphs
  • Iyad A. Kanj and Ge Xia
  • Distance-d Independent Set Problems for Bipartite and Chordal Graphs
  • Hiroshi Eto, Fengrui Guo and Eiji Miyano
Control code
804845691
Dimensions
unknown
Extent
1 online resource (xi, 398 pages)
File format
unknown
Form of item
online
Isbn
9783642317705
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)804845691

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125
Processing Feedback ...