000 06936nam a22006375i 4500
001 978-3-319-12691-3
003 DE-He213
005 20240730165405.0
007 cr nn 008mamaa
008 141113s2014 sz | s |||| 0|eng d
020 _a9783319126913
_9978-3-319-12691-3
024 7 _a10.1007/978-3-319-12691-3
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aCombinatorial Optimization and Applications
_h[electronic resource] :
_b8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings /
_cedited by Zhao Zhang, Lidong Wu, Wen Xu, Ding-Zhu Du.
250 _a1st ed. 2014.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2014.
300 _aXV, 774 p. 218 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8881
505 0 _aAn Exact Algorithm for Non-preemptive Peak Demand Job Scheduling -- An Asymptotic Competitive Scheme for Online Bin Packing -- Randomized Online Algorithms for Set Cover Leasing Problems -- Optimizing Squares Covering a Set of Points -- Algorithms for Fair Partitioning of Convex Polygons -- A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW -- On-Line Strategies for Evacuating from a Convex Region in the Plane -- Rectilinear Duals Using Monotone Staircase Polygons -- Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot -- Guarding Monotone Art Galleries with Sliding Cameras in Linear Time -- Information Gathering in Ad-Hoc Radio Networks with Tree Topology -- Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network -- Approximate Aggregation for Tracking Quantiles in Wireless Sensor Networks -- Interference-Free k-barrier Coverage in Wireless Sensor Networks -- Performance Analysis and Improvement for the Construction of MCDS Problem in 3D Space -- A Practical Greedy Approximation for the Directed Steiner Tree Problem -- Spanning Properties of Theta-Theta Graphs -- A Bicriteria Approximation Algorithm for DVRP with Time Windows -- Data-Oblivious Graph Algorithms in Outsourced External Memory -- A Dichotomy for Upper Domination in Monogenic Classes -- Algorithms for the Maximum Weight Connected k-Induced Subgraph Problem -- Algorithms for Cut Problems on Trees -- The Minimum Vulnerability Problem on Graphs -- The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs -- Two Paths Location of a Tree with Positive or Negative Weights -- Approximation Algorithms for Optimization Problems in Random Power-Law Graphs -- A Comparison Between the Zero Forcing Number and the Strong Metric Dimension of Graphs -- Optimal Trees for Minimizing Average Individual Updating Cost -- Cascading Critical Nodes Detection with Load Redistribution in Complex Systems -- The Power of Rejection in Online Bottleneck Matching -- The Generalized 3-Edge-Connectivity of Lexicographic Product Graphs -- Integer Programming Methods for Special College Admissions Problems -- On the Width of Ordered Binary Decision Diagrams -- Tight Analysis of Priority Queuing for Egress Traffic -- Optimally Bracing Grid Frameworks with Holes -- Top-K Query Retrieval of Combinations with Sum-of-Subsets Ranking -- Efficient Group Testing Algorithms with a Constrained Number of Positive Responses -- Maximizing Revenues for On-Line Dial-a-Ride -- Global Internet Connectedness: 2002-2011 -- Optimal Containment of Misinformation in Social Media: A Scenario-Based Approach -- Multivariate Heavy Tails in Complex Networks -- Mixed Degree-Degree Correlations in Directed Social Networks -- Social and Economic Network Formation: A Dynamic Model -- A Region Growing Algorithm for Detecting Critical Nodes -- A Fast Greedy Algorithm for the Critical Node Detection Problem -- Integer Programming Formulations for Minimum Spanning Forests and Connected Components in Sparse Graphs -- Complexity, Cryptography and Game -- On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints -- Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications -- Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics -- Improved Even Order Magic Square Construction Algorithms and Their Applications -- The Complexity of the Positive Semidefinite Zero Forcing -- A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games -- The Popular Matching and Condensation Problems Under Matroid Constraints -- Incremental Computation of Pseudo-Inverse of Laplacian -- Optimal Tracking of Multiple Targets Using UAVs -- Approximation Algorithm for the Minimum Connected k-Path Vertex Cover Problem.
520 _aThis 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.
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aNumerical analysis.
_94603
650 0 _aComputer networks .
_931572
650 0 _aComputer graphics.
_94088
650 1 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aNumerical Analysis.
_94603
650 2 4 _aComputer Communication Networks.
_988720
650 2 4 _aComputer Graphics.
_94088
700 1 _aZhang, Zhao.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_988721
700 1 _aWu, Lidong.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_988722
700 1 _aXu, Wen.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_988723
700 1 _aDu, Ding-Zhu.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_988724
710 2 _aSpringerLink (Online service)
_988725
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319126906
776 0 8 _iPrinted edition:
_z9783319126920
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8881
_988726
856 4 0 _uhttps://doi.org/10.1007/978-3-319-12691-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c86288
_d86288