Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1

Source URL: www.math.washington.edu

• Mathematics
• Computational complexity theory
• Algebra
• NP-complete problems
• Analysis of algorithms
• Set cover problem
• Bin packing problem
• Linear programming relaxation
• Vertex cover
• Ring
• Exponentiation
• Big O notation

SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted

Source URL: people.mpi-inf.mpg.de

• Computational complexity theory
• Mathematics
• NP-complete problems
• Theory of computation
• Set cover problem
• Approximation algorithm
• Algorithm
• Analysis of algorithms
• Bin packing problem
• Vertex cover

Appendix 2.2 The table covering the educational effects for the area of education in terms of technical sciences by the educational effects of the second-cycle studies: field of study: Civil Engineering, specialization:

Source URL: budeco.pollub.pl

• Education
• Science and technology
• Engineering
• Educational psychology
• Ethics
• Philosophy of science
• Systems engineering
• Design
• Science
• Computing
• Technology
• Problem solving

Approximating Visibility Problems within a Constant E. M ARKOU Computer Science, ECE, National Technical University of Athens, Greece C. F RAGOUDAKIS Computer Science, ECE, National Technical University of Athens, Greece

Source URL: emarkou.users.uth.gr

• Polygons
• NP-complete problems
• Computational problems
• Computational geometry
• Combinatorial optimization
• Art gallery problem
• Visibility graph
• Simple polygon
• Clique
• Cut
• Optimization problem
• Polygon covering

Appendix 2.1 The table covering the educational effects for the area of education in terms of technical sciences by the educational effects of the second-cycle studies: field of study: Civil Engineering, specialization:

Source URL: budeco.pollub.pl

• Educational psychology
• Engineering
• Ethics
• Philosophy of science
• Systems engineering
• Design
• Science
• Computing
• Technology
• Problem solving
• Business engineering
• Computer-aided production engineering

Maximum Motif Problem in Vertex-Colored Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1

Source URL: pagesperso.lina.univ-nantes.fr

• NP-complete problems
• Graph coloring
• Graph connectivity
• Combinatorial optimization
• Matching
• Vertex cover
• Bridge
• Color-coding
• Treewidth
• Neighbourhood
• Covering graph
• Incidence coloring

Solution Report Tracking and Dispatching Service Vehicles Problem: With an expansive mine property covering hundreds of square kilometers and operating over a thousand mining machines

Source URL: www.safe-mine.com

• Tracking
• Geolocation
• Road transport
• Global Positioning System
• Automotive accessories
• Vehicle tracking system
• Fleet management
• Truck
• Location-based service
• Automatic vehicle location

ON COVERING EXPANDER GRAPHS BY HAMILTON CYCLES ´ ROMAN GLEBOV, MICHAEL KRIVELEVICH, AND TIBOR SZABO Abstract. The problem of packing Hamilton cycles in random and pseudorandom graphs has been studied extensively. In thi

Source URL: page.mi.fu-berlin.de

Math.Comput.Sci:97–107 DOIs11786Mathematics in Computer Science On Conditional Covering Problem

Source URL: publications.cse.iitm.ac.in

A Corre tion to \The Number of Non-Isomorphi Solutions to a Problem in Covering Designs" Fran ois Margot Department of Mathemati s University of Kentu ky Lexington, KY

Source URL: wpweb2.tepper.cmu.edu