Experimental Algorithms

11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings

Editors:

ISBN: 978-3-642-30849-9 (Print) 978-3-642-30850-5 (Online)

Table of contents (34 chapters)

Page of 2 next
  1. Contributed Papers

    1. No Access

      Book Chapter

      Pages 236-247

      A Label Correcting Algorithm for the Shortest Path Problem on a Multi-modal Route Network

    2. No Access

      Book Chapter

      Pages 248-259

      Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data

    3. No Access

      Book Chapter

      Pages 260-270

      Candidate Sets for Alternative Routes in Road Networks

    4. No Access

      Book Chapter

      Pages 271-282

      Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation

    5. No Access

      Book Chapter

      Pages 283-294

      An Evaluation of Community Detection Algorithms on Large-Scale Email Traffic

    6. No Access

      Book Chapter

      Pages 295-306

      Fast, Small, Simple Rank/Select on Bitmaps

    7. No Access

      Book Chapter

      Pages 307-319

      Space-Efficient Top-k Document Retrieval

    8. No Access

      Book Chapter

      Pages 320-331

      Engineering Efficient Paging Algorithms

    9. No Access

      Book Chapter

      Pages 332-343

      Feasibility Pump Heuristics for Column Generation Approaches

    10. No Access

      Book Chapter

      Pages 344-355

      Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems

    11. No Access

      Book Chapter

      Pages 356-368

      Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach

    12. No Access

      Book Chapter

      Pages 369-380

      Advanced Coarsening Schemes for Graph Partitioning

    13. No Access

      Book Chapter

      Pages 381-392

      A Heuristic for Non-convex Variance-Based Clustering Criteria

    14. No Access

      Book Chapter

      Pages 393-404

      A Decomposition Approach for Solving Critical Clique Detection Problems

  2. Back Matter

    Pages -

Page of 2 next