000 04416nam a22006135i 4500
001 978-3-642-14553-7
003 DE-He213
005 20240730194402.0
007 cr nn 008mamaa
008 100726s2010 gw | s |||| 0|eng d
020 _a9783642145537
_9978-3-642-14553-7
024 7 _a10.1007/978-3-642-14553-7
_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 _aFrontiers in Algorithms
_h[electronic resource] :
_b4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010, Proceedings /
_cedited by D.T. Lee, Danny Z Chen, Shi Ying.
250 _a1st ed. 2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2010.
300 _aXI, 339 p. 74 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 ;
_v6213
505 0 _aProgress 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.
650 0 _aAlgorithms.
_93390
650 0 _aComputer programming.
_94169
650 0 _aSoftware engineering.
_94138
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aComputer science.
_99832
650 1 4 _aAlgorithms.
_93390
650 2 4 _aProgramming Techniques.
_9156849
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
700 1 _aLee, D.T.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9156850
700 1 _aChen, Danny Z.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9156851
700 1 _aYing, Shi.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9156852
710 2 _aSpringerLink (Online service)
_9156853
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642145520
776 0 8 _iPrinted edition:
_z9783642145544
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v6213
_9156854
856 4 0 _uhttps://doi.org/10.1007/978-3-642-14553-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c95171
_d95171