Atjaunināt sīkdatņu piekrišanu

Combinatorial Optimization and Applications: 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings 2014 ed. [Mīkstie vāki]

Edited by , Edited by , Edited by , Edited by
  • Formāts: Paperback / softback, 774 pages, height x width: 235x155 mm, 218 Illustrations, black and white; XV, 774 p. 218 illus., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 8881
  • Izdošanas datums: 19-Nov-2014
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3319126903
  • ISBN-13: 9783319126906
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 774 pages, height x width: 235x155 mm, 218 Illustrations, black and white; XV, 774 p. 218 illus., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 8881
  • Izdošanas datums: 19-Nov-2014
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3319126903
  • ISBN-13: 9783319126906
This book constitutes the refereed proceedings of the 8th International Conference on Combinatorial Optimization and Applications, COCOA 2014, held on the island of Maui, Hawaii, USA, in December 2014. The 56 full papers included in the book were carefully reviewed and selected from 133 submissions. Topics covered include classic combinatorial optimization; geometric optimization; network optimization; optimization in graphs; applied optimization; CSoNet; and complexity, cryptography, and games.
Classic Combinatorial Optimization
An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling
3(10)
Sean Yaw
Brendan Mumey
An Asymptotic Competitive Scheme for Online Bin Packing
13(12)
Lin Chen
Deshi Ye
Guochuan Zhang
Randomized Online Algorithms for Set Cover Leasing Problems
25(12)
Sebastian Abshoff
Christine Markarian
Friedhelm Meyer auf der Heide
Geometric Optimization
Optimizing Squares Covering a Set of Points
37(16)
Binay Bhattacharya
Sandip Das
Tsunehiko Kameda
Priya Ranjan Sinha Mahapatra
Zhao Song
Algorithms for Fair Partitioning of Convex Polygons
53(13)
Bogdan Armaselu
Ovidiu Daescu
A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW
66(8)
Liang Song
Hejiao Huang
Hongwei Du
On-Line Strategies for Evacuating from a Convex Region in the Plane
74(12)
Qi Wei
Xuehou Tan
Bo Jiang
Lijuan Wang
Rectilinear Duals Using Monotone Staircase Polygons
86(15)
Yi-Jun Chang
Hsu-Chun Yen
Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot
101(12)
Azadeh Tabatabaei
Mohammad Ghodsi
Guarding Monotone Art Galleries with Sliding Cameras in Linear Time
113(16)
Mark de Berg
Stephane Durocher
Saeed Mehrabi
Network Optimization
Information Gathering in Ad-Hoc Radio Networks with Tree Topology
129(17)
Marek Chrobak
Kevin Costello
Leszek Gasieniec
Darek R. Kowalski
Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network
146(15)
Binay Bhattacharya
Tsunehiko Kameda
Approximate Aggregation for Tracking Quantiles in Wireless Sensor Networks
161(12)
Zaobo He
Zhipeng Cai
Siyao Cheng
Xiaoming Wang
Interference-Free k-barrier Coverage in Wireless Sensor Networks
173(11)
Hongwei Du
Haiming Luo
Jing Zhang
Rongrong Zhu
Qiang Ye
Performance Analysis and Improvement for the Construction of MCDS Problem in 3D Space
184(16)
Jun Li
Xiaofeng Gao
Guihai Chen
Fengwei Gao
Ling Ding
A Practical Greedy Approximation for the Directed Steiner Tree Problem
200(16)
Dimitri Watel
Marc-Antoine Weisser
Spanning Properties of Theta-Theta Graphs
216(15)
Mirela Damian
Dumitru V. Voicu
A Bicriteria Approximation Algorithm for DVRP with Time Windows
231(10)
Hao Gu
Liang Song
Hejiao Huang
Hongwei Du
Optimization in Graphs
Data-Oblivious Graph Algorithms in Outsourced External Memory
241(17)
Michael T. Goodrich
Joseph A. Simons
A Dichotomy for Upper Domination in Monogenic Classes
258(10)
Hassan AbouEisha
Shahid Hussain
Vadim Lozin
Jerome Monnot
Bernard Ries
Algorithms for the Maximum Weight Connected k-Induced Subgraph Problem
268(15)
Ernst Althaus
Markus Blumenstock
Alexej Disterhoft
Andreas Hildebrandt
Markus Krupp
Algorithms for Cut Problems on Trees
283(16)
Iyad Kanj
Guohui Lin
Tian Liu
Weitian Tong
Ge Xia
Jinhui Xu
Boting Yang
Fenghui Zhang
Peng Zhang
Binhai Zhu
The Minimum Vulnerability Problem on Graphs
299(15)
Yusuke Aoki
Bjarni V. Halldorsson
Magnus M. Halldorsson
Takehiro Ito
Christian Konrad
Xiao Zhou
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs
314(15)
Tatsuhiko Hatanaka
Takehiro Ito
Xiao Zhou
Two Paths Location of a Tree with Positive or Negative Weights
329(14)
Jianjie Zhou
Liying Kang
Erfang Shan
Approximation Algorithms for Optimization Problems in Random Power-Law Graphs
343(13)
Yilin Shen
Xiang Li
My T. Thai
A Comparison Between the Zero Forcing Number and the Strong Metric Dimension of Graphs
356(10)
Cong X. Kang
Eunjeong Yi
Optimal Trees for Minimizing Average Individual Updating Cost
366(13)
Sicen Guo
Minming Li
Yingchao Zhao
Cascading Critical Nodes Detection with Load Redistribution in Complex Systems
379(16)
Subhankar Mishra
Xiang Li
My T. Thai
Jungtaek Seo
The Power of Rejection in Online Bottleneck Matching
395(17)
Barbara M. Anthony
Christine Chung
The Generalized 3-Edge-Connectivity of Lexicographic Product Graphs
412(17)
Xueliang Li
Jun Yue
Yan Zhao
Applied Optimization
Integer Programming Methods for Special College Admissions Problems
429(15)
Peter Biro
Lain McBride
On the Width of Ordered Binary Decision Diagrams
444(15)
Beate Bollig
Tight Analysis of Priority Queuing for Egress Traffic
459(15)
Jun Kawahara
Koji M. Kobayashi
Tomotaka Maeda
Optimally Bracing Grid Frameworks with Holes
474(16)
Yoshihiko Ito
Yuki Kobayashi
Yuya Higashikawa
Naoki Katoh
Sheung-Hung Poon
Maria Saumell
Top-K Query Retrieval of Combinations with Sum-of-Subsets Ranking
490(16)
Subhashis Majumder
Biswajit Sanyal
Prosenjit Gupta
Soumik Sinha
Shiladitya Pande
Wing-Kai Hon
Efficient Group Testing Algorithms with a Constrained Number of Positive Responses
506(16)
Annalisa De Bonis
Maximizing Revenues for On-Line Dial-a-Ride
522(15)
Ananya Christman
William Forcier
CSoNet
Global Internet Connectedness: 2002--2011
537(10)
Hyunjin Seo
Stuart Thorson
Optimal Containment of Misinformation in Social Media: A Scenario-Based Approach
547(10)
Yongjia Song
Thang N. Dinh
Multivariate Heavy Tails in Complex Networks
557(14)
Golshan Golnari
Zhi-Li Zhang
Mixed Degree-Degree Correlations in Directed Social Networks
571(10)
Michael Mayo
Ahmed Abdelzaher
Preetam Ghosh
Social and Economic Network Formation: A Dynamic Model
581(12)
Omid Atabati
Babak Farzad
A Region Growing Algorithm for Detecting Critical Nodes
593(10)
Mario Ventresca
Dionne Aleman
A Fast Greedy Algorithm for the Critical Node Detection Problem
603(10)
Mario Ventresca
Dionne Aleman
Integer Programming Formulations for Minimum Spanning Forests and Connected Components in Sparse Graphs
613(12)
Neng Fan
Mehdi Golari
Complexity, Cryptography and Game
On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints
625(12)
Faisal N. Abu-Khzam
Judith Egan
Michael R. Fellows
Frances A. Rosamond
Peter Shaw
Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications
637(15)
Iyad Kanj
Stefan Szeider
Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics
652(14)
Bjøm Kjos-Hanssen
Improved Even Order Magic Square Construction Algorithms and Their Applications
666(15)
Zhenhua Duan
Jin Liu
Jie Li
Cong Tian
The Complexity of the Positive Semidefinite Zero Forcing
681(13)
Shaun Fallat
Karen Meagher
Boting Yang
A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games
694(19)
Endre Boros
Khaled Elbassioni
Vladimir Gurvich
Kazuhisa Makino
Miscellaneous
The Popular Matching and Condensation Problems Under Matroid Constraints
713(16)
Naoyuki Kamiyama
Incremental Computation of Pseudo-Inverse of Laplacian
729(21)
Gyan Ranjan
Zhi-Li Zhang
Dan Boley
Optimal Tracking of Multiple Targets Using UAVs
750(14)
David Hay
Shahrzad Shirazipourazad
Arunabha Sen
Approximation Algorithm for the Minimum Connected k-Path Vertex Cover Problem
764(9)
Xiaosong Li
Zhao Zhang
Xiaohui Huang
Author Index 773