Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
Thepapers inthis volumewereselectedfor presentationatthe 4thInternational FrontiersofAlgorithmicsWorkshop(FAW2010),heldduringAugust11-13,2010 at Wuhan University, Wuhan, China. Previous meetings of this workshop were held in Lanzhou (2007), Changsha (2008), and Hefei (2009). In response to the Call-for-Papers, 57 extended abstracts were submitted from 12 countries and regions,of which 28 were accepted. The submitted papers were from China, France, Hong Kong, India, Israel, Italy, Japan, Republic of Korea, Lebanon, The Netherlands, Taiwan, and USA. ThepaperswereevaluatedbyaninternationalProgramCommittee.Each- per was evaluated by at least three ProgramCommittee members, with possible assistance of the external referees, as indicated by the referee list found in these proceedings.Inadditionto theselectedpapers,the workshopalsoincludedthree invited presentations by Mikhail J. Atallah, Deyi Li, and Kurt Mehlhorn, and two training sessions by John Hopcroft and Xiaotie Deng for providing students and young researchers with advanced research experience. WethankallProgramCommitteemembersandtheexternalrefereesfortheir excellent work, especially given the demanding time constraints. Furthermore, we thank the General Conference Co-chairs John Hopcroft and Deyi Li, and the Steering Committee Co-chairs Xiaotie Deng and Franco Preparata. It has been a wonderful experience to workwith all of them. We also thank the three invited speakers,thetwotrainingsessionspeakers,andallauthorswhosubmittedpapers for consideration. They all contributed to the high quality of the workshop. Finally,wethankalllocalorganizers,ledbyRongPeng,andthecolleaguesof the State Key Lab of Software Engineering and the School of Computer, Wuhan University, who worked tirelessly to put in place the logistical arrangements of the workshop and to create and maintain the website of the workshop. It was their hard work that made the workshop possible and enjoyable.
Content Level »Professional/practitioner
Keywords »Matchings - Partition - Scheduling - ad hoc networks - algorithm certifyication - algorithms - auction systems - cellular networks - cloud computing - computational geometry - convex hull - dead locks - design - geometry - graph coloring
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 of Simple Polygons with Two Guards.- Adaptive Algorithms for Planar Convex Hull Problems.- New Algorithms for Barrier Coverage with Mobile Sensors.