Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind†

Source URL: www.levreyzin.com

• NP-complete problems
• Clique problem
• Vertex cover
• Clique
• Independent set
• Bipartite graph
• Travelling salesman problem
• Graph coloring
• Line graph
• Treewidth
• Pathwidth

Moment methods in energy minimization David de Laat Delft University of Technology (Joint with Fernando Oliveira and Frank Vallentin) L´aszl´

Source URL: www.daviddelaat.nl

• Operations research
• Discrete geometry
• NP-complete problems
• Conjectures
• Circle packing
• Sphere packing
• Independent set
• Kepler conjecture
• Tammes problem
• Mathematical optimization
• Semidefinite programming
• FranklRdl graph

CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better

Source URL: theory.stanford.edu

• NP-complete problems
• Computational complexity theory
• Analysis of algorithms
• Operations research
• NP-hard problems
• Vertex cover
• Travelling salesman problem
• Dynamic programming
• Parameterized complexity
• Independent set
• Algorithm
• 2-satisfiability

The Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,∗ , Pim van ’t Hof1,∗ , Marcin Kami´ nski2 , and 3,† Dani¨el Paulusma 1

Source URL: rutcor.rutgers.edu

• Graph theory
• NP-complete problems
• Planar graph
• Dominating set
• Vertex
• Degree
• Cycle
• Line graph
• Bidimensionality

Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem Ant´ onio Morgado and Joao Marques-Silva School of Electronics and Computer Science, University of Southampton, UK ,jpms@e

Source URL: ceur-ws.org

• Operations research
• Mathematical optimization
• Constraint programming
• Logic in computer science
• NP-complete problems
• Topology
• Satisfiability modulo theories
• Dynamic programming
• Semidefinite programming

BASIS PURSUIT IN SENSOR NETWORKS João F. C. Mota1,2 , João M. F. Xavier2 , Pedro M. Q. Aguiar2 , and Markus Püschel3 1 Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, USA 2

Source URL: www.ee.ucl.ac.uk

• Operations research
• Combinatorial optimization
• Theoretical computer science
• Convex optimization
• A* search algorithm
• Algorithm
• NP
• Linear programming
• Belief propagation
• Mean value analysis

On the Tree Search Problem with Non-uniform costs Ferdinando Cicalese, Bal´azs Keszegh, Bernard Lidick´y, D¨om¨ ot¨ or P´alv¨

Source URL: orion.math.iastate.edu

• NP
• Search problem
• Functions and mappings
• Computational problem

Coreset and sampling approaches for the analysis of very large data sets – Part II Christian Sohler Prof. Dr. Christian Sohler Komplexitätstheorie und

Source URL: quentin.mrgt.fr

• Graph theory
• Graph
• NP-complete problems
• Graph coloring

One-Dimensional Partitioning for Heterogeneous Systems: Theory and Practice ⋆ Ali Pınar a,1, E. Kartal Tabak b and Cevdet Aykanat b,2

Source URL: www.sandia.gov

• NP-complete problems
• Operations research
• Combinatorial optimization
• Parallel computing
• Mathematical optimization
• Parametric search
• Algorithm
• Dynamic programming
• Greedy algorithm
• Partition problem
• Distributed computing
• Approximation algorithm

VODIČ KROZ NACIONALNE PARKOVE I PARKOVE PRIRODE REPUBLIKE HRVATSKE Parkovi Hrvatske

Source URL: www.np-kornati.hr