Frontiers in Algorithms  4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010, Proceedings /  [electronic resource] : 
edited by D.T. Lee, Danny Z Chen, Shi Ying. 
 - 1st ed. 2010. 
 - XI, 339 p. 74 illus.  online resource. 
 - Theoretical Computer Science and General Issues,  6213  2512-2029 ; .
 - Theoretical Computer Science and General Issues,  6213 .
<br/><br/>Progress on Certifying Algorithms -- Computational Geometry for Uncertain Data -- On Foundations of Services Interoperation in Cloud Computing -- Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets -- Truthful Auction for CPU Time Slots -- Top-d Rank Aggregation in Web Meta-search Engine -- Minimum Common String Partition Revisited -- Inapproximability of Maximal Strip Recovery: II -- Minimizing Total Variation for Field Splitting with Feathering in Intensity-Modulated Radiation Therapy -- Approximation Schemes for Scheduling with Availability Constraints -- An Space Lower Bound for Finding ?-Approximate Quantiles in a Data Stream -- Improved Sublinear Time Algorithm for Width-Bounded Separators -- Constant Time Generation of Biconnected Rooted Plane Graphs -- Solving General Lattice Puzzles -- A Hybrid Graph Representation for Recursive Backtracking Algorithms -- On Tractable Exponential Sums -- Recognizing d-Interval Graphs and d-Track Interval Graphs -- Categorial Semantics of a Solution to Distributed Dining Philosophers Problem -- Approximation Algorithms for the Capacitated Domination Problem -- A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Weighted Cycle -- FPTAS's for Some Cut Problems in Weighted Trees -- Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks -- Online Algorithms for the Newsvendor Problem with and without Censored Demands -- O((logn)2) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems -- Path Separability of Graphs -- Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings -- Computing Minimum Diameter Color-Spanning Sets -- Approximation Algorithm for the Largest Area Convex Hull of Same Size Non-overlapping Axis-Aligned Squares -- Optimum Sweeps ofSimple Polygons with Two Guards -- Adaptive Algorithms for Planar Convex Hull Problems -- New Algorithms for Barrier Coverage with Mobile Sensors. 
<br/><br/><label>ISBN: </label>9783642145537 
<br/><br/><label>Standard No.: </label>10.1007/978-3-642-14553-7  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Algorithms.<br/>Computer programming.<br/>Software engineering.<br/>Computer science--Mathematics.<br/>Discrete mathematics.<br/>Computer science.<br/>Algorithms.<br/>Programming Techniques.<br/>Software Engineering.<br/>Discrete Mathematics in Computer Science.<br/>Computer Science Logic and Foundations of Programming.
<br/><br/><label>LC Class. No.: </label>QA76.9.A43 
<br/><br/><label>Dewey Class. No.: </label>518.1