| http://dbpedia.org/ontology/abstract
|
In the study of algorithms, an LP-type pro … In the study of algorithms, an LP-type problem (also called a generalized linear program) is an optimization problem that shares certain properties with low-dimensional linear programs and that may be solved by similar algorithms. LP-type problems include many important optimization problems that are not themselves linear programs, such as the problem of finding the smallest circle containing a given set of planar points. They may be solved by a combination of randomized algorithms in an amount of time that is linear in the number of elements defining the problem, and subexponential in the dimension of the problem.ponential in the dimension of the problem.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Smallest_circle_problem.svg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://cg.scs.carleton.ca/~morin/publications/facility/center-ijcga.pdf +
, http://www.cs.ucdavis.edu/~amenta/pubs/helly.pdf +
, http://www.cs.uwaterloo.ca/~tmchan/depth_soda.pdf +
, http://www.cs.uu.nl/research/techreps/repo/CS-2007/2007-025.pdf +
, http://www.inf.ethz.ch/personal/ybrise/data/papers/VS.pdf +
, http://www.people.hbs.edu/dbell/theorem%20on%20integer%20lattice.pdf +
, http://www.inf.ethz.ch/personal/emo/PublFiles/SubexLinProg_ALG16_96.pdf +
, https://www.cs.princeton.edu/~chazelle/pubs/OptimizationFixedDim.pdf +
, http://www.inf.ethz.ch/personal/emo/PublFiles/UniqueSink_FOCS42nd_01.pdf +
, http://www.inf.ethz.ch/personal/gaertner/texts/own_work/mb.pdf +
, http://www.inf.ethz.ch/personal/gaertner/texts/own_work/sampling.pdf +
, http://www.inf.ethz.ch/personal/gaertner/texts/own_work/subex.pdf +
, http://www.lix.polytechnique.fr/~nielsen/pdf/2008-SmallestInformationDisk-IPL.pdf +
, http://www.almaden.ibm.com/u/kclarkson/lp/p.pdf +
, https://drops.dagstuhl.de/opus/volltexte/2008/1527/ +
, https://hal.archives-ouvertes.fr/hal-01621504/file/articleDGCI2017-RepresentationOfDigitalNoisyShapes.pdf +
|
| http://dbpedia.org/ontology/wikiPageID
|
34676009
|
| http://dbpedia.org/ontology/wikiPageLength
|
38815
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1124282962
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Linear_program +
, http://dbpedia.org/resource/Symposium_on_Foundations_of_Computer_Science +
, http://dbpedia.org/resource/Computational_Geometry_%28journal%29 +
, http://dbpedia.org/resource/Algorithmic_game_theory +
, http://dbpedia.org/resource/Centerpoint_%28geometry%29 +
, http://dbpedia.org/resource/Discrete_Applied_Mathematics +
, http://dbpedia.org/resource/Computational_geometry +
, http://dbpedia.org/resource/Optimization_problem +
, http://dbpedia.org/resource/Integer_program +
, http://dbpedia.org/resource/Pointwise_maximum +
, http://dbpedia.org/resource/Prefix_%28computer_science%29 +
, http://dbpedia.org/resource/Bregman_divergence +
, http://dbpedia.org/resource/SIAM_Journal_on_Computing +
, http://dbpedia.org/resource/Algorithm +
, http://dbpedia.org/resource/Mathematics_of_Operations_Research +
, http://dbpedia.org/resource/Algorithmica +
, http://dbpedia.org/resource/Ellipsoid +
, http://dbpedia.org/resource/Convex_hull +
, http://dbpedia.org/resource/Cardinality +
, http://dbpedia.org/resource/Directed_acyclic_graph +
, http://dbpedia.org/resource/1-center_problem +
, http://dbpedia.org/resource/Finite_element_method +
, http://dbpedia.org/resource/Quasiconvex_function +
, http://dbpedia.org/resource/Discrete_and_Computational_Geometry +
, http://dbpedia.org/resource/Lexicographic_order +
, http://dbpedia.org/resource/Function_of_a_real_variable +
, http://dbpedia.org/resource/Convex_optimization +
, http://dbpedia.org/resource/Facility_location +
, http://dbpedia.org/resource/Category:Computational_geometry +
, http://dbpedia.org/resource/Violator_space +
, http://dbpedia.org/resource/File:Lp_Balls.webm +
, http://dbpedia.org/resource/File:Smallest_circle_problem.svg +
, http://dbpedia.org/resource/Symposium_on_Theory_of_Computing +
, http://dbpedia.org/resource/Unique_sink_orientation +
, http://dbpedia.org/resource/Simplex_method +
, http://dbpedia.org/resource/Linear_complementarity_problem +
, http://dbpedia.org/resource/Randomized_algorithm +
, http://dbpedia.org/resource/Category:Linear_programming +
, http://dbpedia.org/resource/Symposium_on_Computational_Geometry +
, http://dbpedia.org/resource/Ordered_pair +
, http://dbpedia.org/resource/Convex_set +
, http://dbpedia.org/resource/Rotating_calipers +
, http://dbpedia.org/resource/Proceedings_of_the_National_Academy_of_Sciences_of_the_United_States_of_America +
, http://dbpedia.org/resource/Information_Processing_Letters +
, http://dbpedia.org/resource/Journal_of_the_ACM +
, http://dbpedia.org/resource/Linear_time +
, http://dbpedia.org/resource/Diameter +
, http://dbpedia.org/resource/Convex_polytope +
, http://dbpedia.org/resource/Hypercube +
, http://dbpedia.org/resource/Smallest_circle_problem +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Harvtxt +
, http://dbpedia.org/resource/Template:Mvar +
, http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Refend +
, http://dbpedia.org/resource/Template:Refbegin +
, http://dbpedia.org/resource/Template:Math +
, http://dbpedia.org/resource/Template:Mabs +
, http://dbpedia.org/resource/Template:Radic +
, http://dbpedia.org/resource/Template:%21 +
, http://dbpedia.org/resource/Template:Harvnb +
, http://dbpedia.org/resource/Template:Harvs +
, http://dbpedia.org/resource/Template:Citation +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Linear_programming +
, http://dbpedia.org/resource/Category:Computational_geometry +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Problem +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/LP-type_problem?oldid=1124282962&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Smallest_circle_problem.svg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/LP-type_problem +
|
| owl:sameAs |
http://www.wikidata.org/entity/Q6459640 +
, https://global.dbpedia.org/id/4pna7 +
, http://rdf.freebase.com/ns/m.0j2535_ +
, http://dbpedia.org/resource/LP-type_problem +
|
| rdf:type |
http://dbpedia.org/ontology/Disease +
|
| rdfs:comment |
In the study of algorithms, an LP-type pro … In the study of algorithms, an LP-type problem (also called a generalized linear program) is an optimization problem that shares certain properties with low-dimensional linear programs and that may be solved by similar algorithms. LP-type problems include many important optimization problems that are not themselves linear programs, such as the problem of finding the smallest circle containing a given set of planar points. They may be solved by a combination of randomized algorithms in an amount of time that is linear in the number of elements defining the problem, and subexponential in the dimension of the problem.ponential in the dimension of the problem.
|
| rdfs:label |
LP-type problem
|
